Insertion Sort is a simple sorting algorithm that builds the final sorted array one item at a time by repeatedly inserting each element into its correct position.

Selection Sort is a sorting algorithm that repeatedly selects the smallest (or largest) element from the unsorted portion and moves it to the end of the sorted portion.

Bubble Sort repeatedly swaps adjacent elements if they are in the wrong order until the list is sorted.

Merge Sort is a divide-and-conquer algorithm that splits the list into halves, sorts each half, and then merges the sorted halves back together.

Quick Sort is a divide-and-conquer algorithm that selects a "pivot" element, partitions the list into elements less than and greater than the pivot, and recursively sorts the partitions.

Linear Search checks each element in a list sequentially until the target element is found or the end of the list is reached.

Binary Search efficiently finds an element in a sorted list by repeatedly dividing the search interval in half.

Breadth-First Search explores a graph or tree level by level, starting from the root or initial node and visiting all neighbors before moving to the next level.

Depth-First Search (DFS) explores a graph or tree by diving as deep as possible into each branch before backtracking.

Sequential Search checks each element in a list one by one until it finds the target or reaches the end.