🎁 New User? Get 20% off your first purchase with code NEWUSER20 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

Object-Oriented Programming (OOP)
A programming paradigm that organizes software design around objects containing data and behavior.
Unit Testing
Testing individual components or functions of a program in isolation to verify they work correctly.
Data Structure
A way of organizing and storing data in a computer so it can be accessed and modified efficiently.
DRY (Don't Repeat Yourself)
A software development principle that aims to reduce code duplication by abstracting common patterns into reusable components.
Regex (Regular Expression)
A sequence of characters that defines a search pattern, used for string matching, validation, and text manipulation.
SOLID Principles Breakdown
Five object-oriented design principles that guide developers in creating maintainable, flexible, and scalable software systems.
View All Programming Concepts Terms →