Depth-first search (DFS) is a traversal algorithm that explores as far as possible along each branch before backtracking.

Breadth First Search is a traversal algorithm that explores all the vertices at the current level before moving to the next level.

Greedy Best-First Search prioritizes nodes based on a heuristic for quick goal achievement.

Quick sort is a comparison-based sorting algorithm that uses a divide-and-conquer strategy to efficiently sort elements in an array.

Bubble sort is a basic sorting algorithm that iteratively compares and swaps adjacent elements in a list until the entire list is sorted.

Insertion sort builds the sorted array by iteratively placing unsorted elements in their correct order.