THE CORE AIM OF VOCABULARY MASTERY · ALGORITHMS VOCABULARY · INPUT → PROCEDURE → COMPLEXITY → CORRECTNESS → OUTPUT
Algorithms vocabulary is the language used to describe step-by-step computational methods for solving problems. Terms such as input, output, iteration, recursion, search, sort, greedy, divide and conquer, dynamic programming and time complexity matter because algorithmic thinking is about more than writing code: it is about choosing and analysing procedures.
The core aim of vocabulary mastery for algorithms vocabulary is procedural reasoning. Learners should be able to explain what problem the algorithm solves, what assumptions it makes, what steps it performs, why it is correct and how its resource use changes as the input grows.
This page is the Algorithms Vocabulary owner inside the eduKateSG Vocabulary hub. For the wider discipline, use Computer Science Vocabulary. For code-level implementation, use Programming Vocabulary.
Central proposition: Algorithms vocabulary is mastered when the learner can explain the method, justify why it works and compare its efficiency with alternatives.
The 60-Second Algorithms Vocabulary Router
- Problem: input, output, constraint, edge case.
- Procedure: step, iteration, recursion, base case.
- Strategy: brute force, greedy, divide and conquer, dynamic programming.
- Search: linear search, binary search, traversal.
- Sort: comparison, stable, in-place, partition.
- Analysis: correctness, invariant, time complexity, space complexity.
The Algorithms Vocabulary Architecture
| Layer | Core terms | Core question |
|---|---|---|
| Problem | input, output, constraint | What must be solved? |
| Method | iteration, recursion, state | What steps are performed? |
| Strategy | greedy, divide and conquer | What general approach is used? |
| Correctness | invariant, proof, edge case | Why should it work? |
| Efficiency | time, space, complexity | How does cost grow? |
| Implementation | data structure, index, pointer | How is the method represented in code? |
Algorithm and Program Are Different
An algorithm is a method for solving a problem. A program is a concrete implementation of one or more algorithms in a programming language. The same sorting algorithm can be implemented in Python, JavaScript, Java or another language.
A Worked Example: Linear Search vs Binary Search
Linear search checks items one by one. Binary search repeatedly halves the remaining search space, but it requires data arranged so the ordering can be used. The vocabulary reveals the trade-off: binary search is faster asymptotically, but it depends on stronger preconditions.
A Worked Example: Recursion
Recursion solves a problem by reducing it to smaller instances of the same kind. A recursive algorithm needs a base case that stops the process and a recursive step that makes progress toward that case.
Time Complexity and Space Complexity
Time complexity describes how the amount of computational work grows with input size. Space complexity describes how memory use grows. Big-O notation such as O(n), O(log n) and O(n²) expresses growth rates rather than exact runtime.
Greedy and Dynamic Programming
A greedy algorithm repeatedly makes a locally attractive choice and hopes those choices produce a global optimum. Dynamic programming solves overlapping subproblems and reuses their results. The strategies may solve similar-looking problems but rely on different structural properties.
Correctness Vocabulary
Terms such as invariant, precondition, postcondition, termination and counterexample help learners explain why an algorithm works, not merely whether it happened to work on a few examples.
How to Learn Algorithms Vocabulary
- Trace algorithms by hand on small inputs.
- Write the input and output explicitly.
- Compare two strategies for the same problem.
- Count operations at different input sizes.
- Identify base cases and invariants.
- Implement the algorithm only after the method is clear.
- Explain why the algorithm fails on edge cases.
Common Algorithms Vocabulary Mistakes
Confusing algorithm with code
Repair: describe the language-independent procedure first.
Treating Big-O as exact speed
Repair: understand it as growth-rate analysis.
Using recursion without a base case
Repair: identify the stopping condition and progress measure.
Calling every fast-looking choice greedy
Repair: ask whether the algorithm makes locally optimal choices without revisiting them.
Frequently Asked Questions
What is algorithms vocabulary?
It is the specialised language used to describe computational methods, strategies, correctness and efficiency.
What algorithm terms should beginners learn first?
Start with input, output, iteration, recursion, search, sort, complexity, base case and edge case.
What is Big-O notation?
It is notation used to describe how resource use grows as input size increases.
What is an invariant?
It is a property that remains true at defined points throughout an algorithm and can help prove correctness.
How can I learn algorithm vocabulary?
Trace procedures on paper, compare strategies and connect terminology to the decisions each algorithm makes.
Where This Article Fits in the eduKateSG Vocabulary Ecosystem
- Vocabulary Hub — the broad route.
- Computer Science Vocabulary — core computational concepts.
- Programming Vocabulary — implementation language.
- Data Science Vocabulary — analytical applications.
- Machine Learning Vocabulary — learning algorithms.
The Algorithms Vocabulary Standard
Algorithms vocabulary reaches its core aim when the learner can state the problem, explain the method, justify correctness and compare resource growth with alternatives.
That is the standard: procedural language precise enough to reason before coding.