Algorithms

Search Algorithms

Linear Search

The Linear Search algorithm searches through a list linearly. When it encounters the target value, it returns the index.

Geeks For Geeks Linear Search

Binary Search

The Binary Search algorithm searches through a sorted list. It keeps track of lower and upper limits and narrows down the possible index positions of the target.

Geeks for Geeks Binary Search

Sorting Algorithms

Bubble Sort

The Bubble Sort algorithm repeatedly iterates through a list, comparing and swapping adjacent elements to order the list.

Geeks for Geeks Bubble Sort

Insertion Sort

The Insertion Sort algorithm divides the list into a sorted and an unsorted section. Each element in the unsorted section is inserted at the appropriate location in the sorted section.

Geeks for Geeks Insertion Sort

Selection Sort

The Selection Sort algorithm divides the list into a sorted and an unsorted section. The minimum value from the unsorted section is removed and added to the end of the sorted section.

Geeks for Geeks Selection Sort

Merge Sort

The Merge Sort algorithm is a divide-and-conquer algorithm that breaks up a list into its individual elements and reassembling the broken elements into an ordered list.

Geeks for Geeks Merge Sort