What Sorting Techniques and Time Complexities Should You Know?

  • Thread starter Thread starter Pattielli
  • Start date Start date
  • Tags Tags
    Sorting
AI Thread Summary
The discussion centers on various sorting techniques and their time complexities. Key algorithms mentioned include bubble sort, quick sort, and introsort, with introsort highlighted as a state-of-the-art method in comparison-based sorting. Resources such as Numerical Recipes and various online platforms are recommended for further exploration of sorting algorithms and their complexities. Quicksort is noted as a preferred choice among the algorithms discussed.
Pattielli
Messages
296
Reaction score
0
Would you please tell me how many a sorting technique you have implemented or you have heard of ? And if you don't care, please also give me some information about time complexities of the algorithms you mention...

Thank you very much,
 
Computer science news on Phys.org
look at the numerical recipies website www.nr.com for all of the standard sorting algorithms...
 
Pattielli said:
Would you please tell me how many a sorting technique you have implemented or you have heard of ? And if you don't care, please also give me some information about time complexities of the algorithms you mention...

Thank you very much,

Off hand I know of only two: bubble sort and quick sort

Pete
 
Introsort is state of the art in comparison based sorting, I think. Is it in nr?
 
Quicksort is probably my favorite.
 
Thank you everyone,
 
Back
Top