ikp4succes: I just wrote it, just now.

you can test with this bubleSort(arr, arr.size());

first

current

asalimpo:
you get zero for presentation. YOu should have copied that code out and posted in in plain text
instead of torture the viewer from picking it out from a black background.
- java has arrays.sort, which uses timsort, most efficient sorting algorithm so far for now.
- use intuitive naming conventions.
rename the variable

first

to

current

so that the intent of the code can be clearer.

Javanian: It looks okay, apart from the little overhead it may encounter as a result of adding and removing from from an array list rather than an array.

ikp4succes:

ye i knw about the memory use from array list instead of primitive arrays, since bubble sort sucks i don't think the time difference will matter anyway.

elvis10ten: primitive arrays ? An array is an object. An array that holds primitives or object references would be the right word?

ikp4succes:

but u get what am trying to say