tag

#iterative

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 7. Divide and Conquer Sorting ›

Bottom Up Merge Sort

Bottom Up Merge Sort Bottom up merge sort removes recursion and builds the sorted array iteratively. It starts by treating each element as a sorted run of size one, then repeatedly merges adjacent runs of increasing size. This form improves control over memory access and avoids recursion overhead. It is commonly used in systems where stack usage must remain bounded. Problem Given an array $A$ of length $n$, reorder it...

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Iterative Binary Search

Iterative Binary Search Iterative binary search is the standard loop-based implementation of binary search. It avoids recursion and therefore uses constant extra space. The logic maintains a shrinking interval until the target is found or the interval becomes empty. This form is preferred in systems code because it has no call overhead and predictable control flow. Problem Given a sorted array $A$ of length $n$ and a value $x$, find...