Java has a very efficient built in implementation of quick sort. You can use it on any array of primitives or Comparable Objects by invoking Arrays.sort(<array>)
See related link.
here you will a good example on java sorting algorithm application http://javacodespot.blogspot.com/2010/08/java-sorting-animations.html http://javacodespot.blogspot.com/
// the build in sorting functions in Java will sort pretty much any array // of Comparable objects or primitives Arrays.sort(someArray);
assembly language program for sorting an array using 8086 microprocessor.
array example in java
One might need a sting array object in Java to use protective measures on one's computer to prevent one's program from writing outside the bounds of the array.
// Let's assume we're sorting the characters in String toSort // convert the String to an array of characters char[] chars = toSort.toCharArray(); // let Java do the sorting for you Arrays.sort(chars); // recreate the original String with the newly sorted array of characters toSort = new String(chars);
The built in array sorting algorithm (java.util.Arrays.sort) depends on the type of data being sorted. Primitive types are sorted with a modified implementation of quicksort. Objects are sorted with a modified implementation of mergesort.
/* PROGRAM TO SORT ARRAY ELEMENTS USING BUBBLE SORT*/ #include #include void main() { int i,j,n,t,a[50]; clrscr(); printf("ENTER THE ARRAY SIZE:\n"); scanf("%d",&n); printf("ENTER THE ARRAY ELEMENTS:\n"); for(i=0;i
Java is a free program which can be downloaded from the official site. The official site hosts an array of java related programs ranging from SDK's to just the runtime enviroment.
plz as soon as possible give me the program for shorting an array in asscending order without using any sort function in c++
Sorting an array.
for(int i = 1; i < 100; i+=2) { System.out.println(i); }