answersLogoWhite

0

WHAT ARE THE DIFFERENT FUNCTIONS IN SORTING AN ARRAY?

Updated: 8/21/2019
User Avatar

Prabinarout

Lvl 1
8y ago

Best Answer

Sort(), arsort(),
asort(), ksort(),
natsort(), natcasesort(),
rsort(), usort(),
array_multisort(), and
uksort().

User Avatar

Wiki User

8y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: WHAT ARE THE DIFFERENT FUNCTIONS IN SORTING AN ARRAY?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Sorting of array through function in java programming?

// the build in sorting functions in Java will sort pretty much any array // of Comparable objects or primitives Arrays.sort(someArray);


What are the Application of quick sort?

Sorting an array.


What is useful to implement quick sort?

Knowledge and experience.


Sorting an array of numbers in java?

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/


What is internal and external sorting techniques?

Internal sorting it means we are arranging the number within the array only which is in computer primary memory. External sorting it is the sorting of numbers from the external file by reading it from secondary memory.


What is the different sorting algorithms for arrays in java?

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.


Sorting an array of objects through in built function?

Object[] arrayToBeSorted; Arrays.sort(arrayToBeSorted);


What are advantages and disadvantages of merging?

merge sort is the most efficient way of sorting the list of array.


What is the Java program for sorting an array?

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.


What is a implementation on n numbers of term in bubble sorting?

void bubblesort (int* array, int size) { if (!array size<2) return; int last_swap = size; while (last_swap>0) { int n=last_swap; for (int i=1; i<last_swap; ++i) { if (array[i]<array[i-1]) { array[i]^=array[i-1]^=array[i]^=array[i-1]; n=i; } last_swap = n; } }


What is the primary functions of this cell part Golgi body?

packing and sorting


What is the best sorting technique for already sorted array?

If it is already sorted, the best is to leave the array as it is.If it is already sorted, the best is to leave the array as it is.If it is already sorted, the best is to leave the array as it is.If it is already sorted, the best is to leave the array as it is.