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.

A linear data structure where elements are stored in nodes, each containing data and a pointer to the next node in the sequence.

Event-Driven Architecture

A software design pattern where components communicate by producing and consuming events rather than direct method calls.

Functional Programming

A programming paradigm that treats computation as the evaluation of mathematical functions, avoiding state changes and mutable data.

Code that is easy to read, understand, and maintain — following consistent conventions, meaningful naming, and single-responsibility functions.

Version Control

A system that records changes to files over time, allowing you to recall specific versions, collaborate, and track history.

View All Programming Concepts Terms →