Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
array sorting
i know there are lots of codes about this but i tried to write my own.
what is wrong with that?
public static void sortingArrays( int[] a){ int k = 0; int index = a[0]; int[] a2 = new int[a.length]; for(int i=0; i<a.length; i++){ for(int j=0; j<a.length; j++){ if ( a[j] > index ){ index = a[j]; k=j;} } a[k] = 0; a2[i] = index; System.out.print(a2[i]); } }
Last edited by copeg; June 26th, 2010 at 10:28 AM. Reason: Please use the CODE tags
Related threads:
Re: array sorting
You never reset your index value for your outer loop so it will re-evaluate each inner loop based upon the next found max number. Some pointers
1) Arrays.sort() is much easier and much faster for simple array sorting.
2) you can use Integer.MIN_VALUE rather than 0 if you wish to also sort an array with negative numbers
3) see Sorting algorithm - Wikipedia, the free encyclopedia if you wish to try your hand at more efficient sorting algorithms.
Re: array sorting
thank you for your answer. I corrected the code, now I'm happy
Reply With Quote