Important Sorting Algorithms-

Bubble Sort: Bubble Sort is the most basic sorting algorithm, and it works by repeatedly swapping adjacent elements if they are out of order.

Merge Sort: Merge sort is a sorting technique that uses the divide and conquer strategy.

Quicksort: Quicksort is a popular sorting algorithm that performs n log n comparisons on average when sorting an array of n elements. It is a more efficient and faster sorting algorithm.

Heap Sort: Heap sort works by visualizing the array elements as a special type of complete binary tree known as a heap.

Important Searching Algorithms-

Binary Search: Binary search employs the divide and conquer strategy, in which a sorted list is divided into two halves and the item is compared to the list’s middle element. If a match is found, the middle element’s location is returned.

Breadth-First Search(BFS): Breadth-first search is a graph traversal algorithm that begins at the root node and explores all neighboring nodes.

Depth-First Search(DFS): The depth-first search (DFS) algorithm begins with the first node of the graph and proceeds to go deeper and deeper until we find the goal node or node with no children.

#coding