Algo four"O"threeAboutAboutContact ↗Contact ↗ (opens in a new tab)
GitHubGitHub (opens in a new tab)
  • Introduction
  • Searching Algorithm
    • Binary Search
    • Breadth-First Search
    • Depth-First Search
    • Jump Search
    • Linear Search
    • Rabin-Karp
  • Sorting Algorithm
    • Bubble Sort
    • Heap Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Radix Sort Algorithm
    • Selection Sort Algorithm
    • Shell Sort
    • Bellman Ford Algo
    • Boruvka's Algorithm
    • Dijkstra's Algorithm
    • Flood Fill Algo
    • Floyd Warshall
    • Johnson's Algorithm
    • Kruskal's Algorithm
    • Prim's Algorithm
    • Tarjan's Algorithm
  • Introduction
    • What is Algorithms?
  • Searching Algorithm
    • Binary Search
    • Breadth-First Search
    • Depth-First Search
    • Jump Search
    • Linear Search
    • Rabin-Karp
  • Sorting Algorithm
    • Bubble Sort
    • Heap Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Radix Sort Algorithm
    • Selection Sort Algorithm
    • Shell Sort
    • Bellman Ford Algo
    • Boruvka's Algorithm
    • Dijkstra's Algorithm
    • Flood Fill Algo
    • Floyd Warshall
    • Johnson's Algorithm
    • Kruskal's Algorithm
    • Prim's Algorithm
    • Tarjan's Algorithm
  • About
  • Contact ↗ (opens in a new tab)

On This Page

  • What is Algorithms?
Question? Give us feedback → (opens in a new tab)Edit this page
Introduction

Introduction To Algorithms

What is Algorithms?

An algorithm is similar to a formula for resolving a particular issue. It's a series of unambiguous actions that computers (or people) can do to arrive at a specific outcome, such as sorting a list of numbers or determining the fastest route on a map.

Searching Algorithm