The quickest sorting algorithm is quicksort with an average running time of n log n, worst case is n^2
The easiest and simplest is bubble sort, average running time is n^2, worst case is n^2 as well.
Wat is the sorting algorithm in c++?
stable sorting : sort ( v1.begin ( ),v1.end ( ) ) ;
or
partial_sort (v1.begin ( ) , v1.begin ( ) +3 , V1.end ( ) ) ;
Reply:There are many sorting algorithms. Which one you are talking about? Mergesort, binary sort, etc?
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment