Skip to content

Latest commit

 

History

History
20 lines (14 loc) · 940 Bytes

File metadata and controls

20 lines (14 loc) · 940 Bytes

Searching Algorithms

Table of Contents

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

Sorting Algorithms

This repository contains implementations of various sorting algorithms.

Table of Contents