Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a program that is just one big for loop. I first have an empty set. On each iteration of the for loop I need to peek and remove the minimum value from the set. Also in each iteration I can add anywhere from 0 to 8 values to the set(values are random). Which built in Java data structure should I use? I considered doing a bubble sort with an ArrayList and just taking out the first index. I’m am looking for the the fastest algorithm to accomplish this task.
Try PriorityQueue. It provides O(log(n)) time for the insertion methods (
add(),remove()); constant time for the retrieval methods(size(),peek()).