๐ŸŽ New User? Get 20% off your first purchase with code NEWUSER20 ยท โšก Instant download ยท ๐Ÿ”’ Secure checkout Register Now โ†’
Menu

Categories

Programming Concepts Beginner

What is Algorithm?

A step-by-step procedure for solving a problem or performing a computation, defined as a finite sequence of instructions.

Algorithms are the foundation of computer science. They define how to solve problems efficiently. Key properties include correctness (produces right output), efficiency (time and space complexity), and finiteness (terminates).

Common algorithm types include sorting (quicksort, mergesort), searching (binary search), graph algorithms (Dijkstra, BFS/DFS), dynamic programming, and greedy algorithms. Algorithm efficiency is measured using Big O notation.

Related Terms

API Design
The practice of designing application programming interfaces that are consistent, intuitive, and maintainable for developers to consume.
Twelve-Factor App
A methodology of twelve best practices for building modern, scalable, maintainable software-as-a-service applications.
Binary Search
An efficient search algorithm that finds a target value in a sorted array by repeatedly dividing the search interval in half.
Big O Notation
A mathematical notation that describes the worst-case performance of an algorithm as input size grows.
Version Control
A system that records changes to files over time, allowing you to recall specific versions, collaborate, and track history.
Regex (Regular Expression)
A sequence of characters that defines a search pattern, used for string matching, validation, and text manipulation.
View All Programming Concepts Terms โ†’