Its the code you write that solves problems :)
“In computer programming terms, an
algorithmis a set of well-defined instructions to solve a particular problem.”
Search algorithm to find a target value in a sorted array, with each iteration half the values are eliminated.
Choose a pivot and swap elements that are smaller to the left of the pivot and bigger to the right of the pivot
Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then it merges the two sorted halves.