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

Regex (Regular Expression)

A sequence of characters that defines a search pattern, used for string matching, validation, and text manipulation.

A data structure that follows First-In-First-Out (FIFO) ordering, where elements are added at the rear and removed from the front.

Singleton Pattern

A design pattern that restricts a class to a single instance and provides a global point of access to that instance.

Observer Pattern

A design pattern where an object (subject) maintains a list of dependents (observers) that are notified automatically of state changes.

The ability of a program to manage multiple tasks that can make progress during overlapping time periods.

The implied cost of additional rework caused by choosing a quick solution now instead of a better approach that would take longer.

View All Programming Concepts Terms →