๐ŸŽ 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

Data Structure
A way of organizing and storing data in a computer so it can be accessed and modified efficiently.
Code Smell
A surface indication in code that usually corresponds to a deeper problem in the system, suggesting the need for refactoring.
Immutable Object
An object whose state cannot be modified after creation, providing thread safety and predictable behavior in concurrent systems.
Factory Pattern
A creational design pattern that provides an interface for creating objects without specifying their exact classes.
Composition over Inheritance
A design principle favoring object composition (has-a relationships) over class inheritance (is-a relationships) for code reuse.
Queue
A data structure that follows First-In-First-Out (FIFO) ordering, where elements are added at the rear and removed from the front.
View All Programming Concepts Terms โ†’