Sort

Sorting is ordering a list of objects. We can distinguish two types of sorting. If the number of objects is small enough to fits into the main memory, sorting is called internal sorting. If the number of objects is so large that some of them reside on external storage during the sort, it is called external sorting. In this chapter we consider the following internal sorting algorithms

By Complexity

• Time Complexity:
  • Bubble Sort
  • Selection Sort
  • Insertion Sort (min:
• Time Complexity:
  • Quick Sort (Space Complexity: )
  • Merge Sort (Space Complexity: )
  • Heap Sort
• Time Complexity: && Space Complexity:
  • Bucket sort

By Stable

• Stable
  • Insertion sort
  • Merge Sort
• Not Stable
  • Bubble Sort
  • Selection Sort
  • Quick Sort
  • Merge Sort
  • Heap Sort