Skip to content

Latest commit

 

History

History
68 lines (39 loc) · 2.1 KB

File metadata and controls

68 lines (39 loc) · 2.1 KB

DataStructures and Algorithms Cheat Sheet

Stability: Means two objects with equal keys appear in the same order in sorted output as they appear in the input array to be sorted (يعني بيظهروا بالترتيب الصحيح)

In-place: Means the algorithm does not need extra space and produces an output in the same memory that contains the data by transforming the input ‘in-place’. However, a small constant extra space used for variables is allowed. (ما بيستلزم مساحات تخزين إضافية)

Bubble sort:

  • Stable ✔️
  • In place ✔️

Bubble Sort

Merge sort:

  • Stable ✔️
  • Not in place ✖️

Merge Sort

Selection sort:

  • Not stable ✖️
  • In place ✔️

Selection Sort

Insertion sort:

  • Stable ✔️
  • In place ✔️

Insertion Sort

Shell sort:

  • Not stable ✖️
  • In place ✔️

Shell Sort

Quick sort:

  • Not stable ✖️
  • In place ✔️

Quick Sort

Heap sort:

  • Not stable ✖️
  • In place ✔️

Heap Sort

Algorithms:

Algorithms

Data Structures:

DS

Traversing

TV

Contribution by @amanWamda

Assignment 6 + 7 solutions including chapters 8, 9 and 10