linear search

binary search Algorithms Analysis

ln ‫ بس املخرج عاوز‬log ‫ عادي يجي بدالها‬ln ‫الـ‬

Heap Sort factorial(n)
‫اما مساحتها بامليموري‬

Insertion at the End (Append)

merge sort Insertion at the Beginning (Prepend)
‫ومساحتها‬ Singly Linked Lists
Searching and Sorting Insertion After an Element

Deleting First Element

Average run time
Insertion at the End (append)
‫مساحتها‬
QuickSort Doubly Linked Lists Insertion at the Beginning (prepend)

Insertion Before an Element

Worst case run time
‫ومساحتها‬ Array & Linked Lists Insertion Before an Element

Selection sort Traversal

insertion sort Singly Linked Lists Searching

bubble sort Deleting Last Element

Deleting a specific element

Traversal
Graphs Complexity Doubly Linked Lists
Deletion

push()

Stack as Array pop()

getTop()

push()
Trees
Stack as Linked list pop()
Stacks
getTop()

worst case pushing full ‫ كان‬stack ‫إذا الـ‬

getHead()
Queue As Array
enqueue()
Towers of Hanoi puzzle Recursion
getHead()

Queue As Circular Array enqueue()

dequeue()

getHead()
Queues Queue As Linked List enqueue()

dequeue()

Queue As Array dequeue()

Priority Queues ‫التوتل تايم للـ‬