- Linear Search: A simple search algorithm that checks every element in a list until the desired element is found or the list ends.
- Binary Search: A more efficient search algorithm that works on sorted lists by repeatedly dividing the search interval in half.
- Recursive Binary Search: A variant of binary search that uses recursion to divide the search interval.
- Square Root of a Number: This algorithm calculates the square root of a number using a method such as the Newton-Raphson method.
This repository contains implementations of various sorting algorithms.