A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.
For example: The below list of characters is sorted in increasing order of their ASCII values. That is, the character with lesser ASCII value will be placed first than the character with higher ASCII value.
PDF Version Quick Guide Resources Job Search Discussion. Applications of Data Structure and Algorithms. Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created independent of underlying languages, i.e. An algorithm can be. Algorithm Analysis in C, second edition, published by Addison-Wesley. These answers reflect the state of the book in the first printing. Specifically omitted are likely programming assignments and any question whose solu-tion is pointed to by a reference at the end of the chapter. Solutions vary in degree of complete. Analysis of Algorithms 4 Average Case vs. Worst Case Running Time of an Algorithm. An algorithm may run faster on certain data sets than on others,. Finding theaverage case can be very difficult, so typically algorithms are measured by the worst-case time complexity.
‘Recent Articles’ on Sorting
Topic :
Basic :
Sorting Algorithms :
Library Implementations of Sorting Algorithms :
Misc :
Coding Problems :
Quick Links :
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above