Tutorialspoint | Gatesmashers | Techdevguide | Geeksforgeeks | freecodecamp | More...

Algorithms

Searching

Linear Search

• Summery : Checks sequentially each element of an array for a match, returning it's index if found.
• Complexity : ◉ Time O(1) ⇌ O(n) ▣ Space O(1)

Binary Search

• Summery : Checks in a sorted array by repeatedly halving the search space based on comparisons with the middle element.
• Complexity : ◉ Time O(1) ⇌ O(log n) ▣ Space O(1)

Sorting

Selection Sort

• Summery : Repeatedly finds the minimum element and places it at the beginning, gradually building a sorted subarray.
• Complexity : ◉ Time O(n^2) ▣ Space O(1)

Bubble Sort

• Summery : Repeatedly compares adjacent elements, swapping them if out of order, to gradually move larger elements to the end.
• Complexity : ◉ Time O(n) ⇌ O(n^2) ▣ Space O(1)

Insertion Sort

• Summery : Repeatedly compares adjacent elements, swapping them if out of order, to gradually move larger elements to the end.
• Complexity : ◉ Time O(n) ⇌ O(n^2) ▣ Space O(1)

Data Structures

Linear & Dynamic

Queue (FIFO)

• Summery : Queue is a linear data structure that follows the FIFO (First-In, First-Out) principle. Elements are added at one end (rear) and removed from the other end (front).
• Operayions : Enqueue, Dequeue, Peek/Front, IsEmpty, IsFull.

Stack (LIFO)

• Summery : stack is a linear data structure that follows the LIFO (Last-In, First-Out) principle. Elements are added and removed from the same end (front), called the top of the stack.
• Operayions : Push, Pop, Peek, IsEmpty, IsFull.

---

Link List

Non-Linear

• Tree
• Graph

---

Loading...