it wasn't cross posted if you read my last post. My last post stated i didn't know how to create the algorithm. Now i created the algorithm but now I need help finding a way to sort multiple sizes.
Type: Posts; User: itispj
it wasn't cross posted if you read my last post. My last post stated i didn't know how to create the algorithm. Now i created the algorithm but now I need help finding a way to sort multiple sizes.
i figured it out.
So, this is what I've got down so far with my BucketSort.java I created two buckets, master bucket and sub buckets[10].
Ask user to enter integers from 0 - 9999
Take user input and add to...
yeah, slipped my mind haha. thanks!
for(int i = 0; i < mBucket.size(); i++)
{
c = (String) mBucket.get(0);
a = Integer.toString(c);
}
mBucket is an arrayList and what the for loop...
I'm trying to figure out how to create a BucketSort program, but I keep running into speed bumps. So far... I've created two arrayList
public static ArrayList mBucket = new ArrayList();//master...
thank you for the responses but i figured it out.
what i was doing wrong was as i was looping through the array, i was indeed removing the element at position i but that also changed the size of...
I'm creating a binsort program and I ran into a problem. I created a ArrayList bucket and asked the user to input values. Let's say it has elements [1, 2, 3, 4, 5, 6, 7] and I'm using a for loop to...