In simple words, a loop invariant is some predicate (condition) that holds for every iteration of the loop. For example, let’s look at a simple `for`

loop that looks like this:

int j = 9; for(int i=0; i<10; i++) j--;

In this example it is true (for every iteration) that `i + j == 9`

. A weaker invariant that is also true is that `i >= 0 && i <= 10`

.

### Related Posts:

- What is a loop invariant?
- What is a loop invariant?
- What is the meaning of “exclusive” and “inclusive” when describing number ranges?
- What is the difference between tree depth and height?
- In a triangulated isometric grid, what triangle is a given point in?
- What does O(log n) mean exactly?
- how to calculate binary search complexity
- What is boilerplate code?
- When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]
- What does O(log n) mean exactly?
- What is Sliding Window Algorithm? Examples?
- Quicksort with Python
- how to implement quick sort algorithm in C++
- Python: maximum recursion depth exceeded while calling a Python object
- Why is the time complexity of both DFS and BFS O( V + E )
- Time complexity of a Priority Queue in C++
- What is stability in sorting algorithms and why is it important?
- Breadth First Search time complexity analysis
- Counting the sum of every nodes’ neighbors’ degrees?
- Time Complexity of the Kruskal Algorithm?
- Quick Sort Vs Merge Sort
- Polynomial time and exponential time
- Insertion Sort vs. Selection Sort
- Difference and advantages between dijkstra & A star
- Best Case for Bubble Sort
- How to find the kth smallest element in the union of two sorted arrays?
- Big O, how do you calculate/approximate it?
- Performing Breadth First Search recursively
- Is Quicksort in-place or not?
- longest increasing subsequence(O(nlogn))
- O(n log n) vs O(n) — practical differences in time complexity
- When should I use Kruskal as opposed to Prim (and vice versa)?
- Trying to understand max heapify
- Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
- Python Weighted Random [duplicate]
- What’s a good algorithm to generate a maze?
- Intuition for perceptron weight update rule
- Easy: Solve T(n)=T(n-1)+n by Iteration Method
- What is tail call optimization?
- PacMan: what kinds of heuristics are mainly used?
- Quicksort vs heapsort
- Big-oh vs big-theta
- Best case time complexity for selection sort
- Looking for algorithm finding euler path
- Trie complexity and searching
- What does this definition of contiguous subsequences mean?
- Is log(n!) = Θ(n·log(n))?
- Is complexity O(log(n)) equivalent to O(sqrt(n))?
- How to find maximum spanning tree?
- Exactly how many comparisons does merge sort make?
- Algorithm to return all combinations of k elements from n
- How to calculate big-theta
- What is the time complexity of while loops?
- Merge sort time and space complexity
- Intuitive explanation for why QuickSort is n log n?
- Calculate distance between two latitude-longitude points? (Haversine formula)
- Shuffle a deck of cards in Java
- How to calculate time complexity of backtracking algorithm?
- Median of Medians in Java
- Hash table runtime complexity (insert, search and delete)
- What is the difference between a heuristic and an algorithm?
- Which is better: O(n log n) or O(n^2)
- What is O(log* N)?
- Quickselect time complexity explained
- What is the proper equivalent of “while(true)” in plain C?
- Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?
- Asymptotic Notation – does n (log n) (log n) simplify?
- Difference between Big-O and Little-O Notation
- What is the big-O of the function (log n)^k
- How to calculate an angle from three points?
- Why is O(n) better than O( nlog(n) )?
- How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
- Is there an O(n) integer sorting algorithm?
- An example of Best Case Scenario for Quick Sort (Need someone to check if my answer is correct)
- how to write a recurrence relation for a given piece of code
- Why is merge sort worst case run time O (n log n)?
- Why is merge sort worst case run time O (n log n)?
- What is the time and space complexity of a breadth first and depth first tree traversal?
- Create your own MD5 collisions
- Image Segmentation using Mean Shift explained
- Finding the median of an unsorted array
- Difference between Big-Theta and Big O notation in simple language
- What is the difference between bucket sort and radix sort?
- How are the following functions O(N^3)?
- Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
- Finding all possible combinations of numbers to reach a given sum
- Are there any real O(n^n) algorithms?
- Sorting an array in C?
- Is Dijkstra’s algorithm for directed or undirected graphs?
- How to determine if a point is in a 2D triangle?
- Modular multiplicative inverse function in Python
- Minesweeper solving algorithm
- About bubble sort vs merge sort
- How do I check if an array includes a value in JavaScript?
- Kadane’s algorithm explained
- Unfamiliar symbol in algorithm: what does ∀ mean? [closed]
- Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
- Algorithms in O(n^2) vs O(n) [duplicate]
- What is a class constant?
- Which algorithm is faster O(N) or O(2N)?