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 ✔️

Merge sort:

• Stable ✔️
• Not in place ✖️

Selection sort:

• Not stable ✖️
• In place ✔️

Insertion sort:

• Stable ✔️
• In place ✔️

Shell sort:

• Not stable ✖️
• In place ✔️

Quick sort:

• Not stable ✖️
• In place ✔️

Heap sort:

• Not stable ✖️
• In place ✔️

Algorithms:

Data Structures:

Traversing

Contribution by @amanWamda

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