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.

Learn More About This Topic

Java Programming for Complete Beginners

Related reading

JavaScript ES6+ Modern Features

Related reading

JavaScript Fundamentals

Related reading

Related Terms

Dependency Injection

A design pattern where objects receive their dependencies from external sources rather than creating them internally.

An efficient search algorithm that finds a target value in a sorted array by repeatedly dividing the search interval in half.

Two memory regions: the stack stores function call data with automatic cleanup, while the heap stores dynamically allocated objects.

A reusable solution template for commonly occurring problems in software design.

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

Composition over Inheritance

A design principle favoring object composition (has-a relationships) over class inheritance (is-a relationships) for code reuse.

View All Programming Concepts Terms →