What is the meaning of “exclusive” and “inclusive” when describing number ranges?

The following function prints the powers of 2 from 1 through n (inclusive).

This means that the function will compute 2^i where i = 1, 2, ..., n, in other words, i can have values from 1 up to and including the value n. i.e n is Included in Inclusive

If, on the other hand, your book had said:

The following function prints the powers of 2 from 1 through n (exclusive).

This would mean that i = 1, 2, ..., n-1, i.e. i can take values up to n-1, but not including, n, which means i = n-1 is the highest value it could have.i.e n is excluded in exclusive.

Related Posts:

  1. What is a loop invariant?
  2. What is a loop invariant?
  3. What is a loop invariant?
  4. What is the difference between tree depth and height?
  5. In a triangulated isometric grid, what triangle is a given point in?
  6. What does O(log n) mean exactly?
  7. how to calculate binary search complexity
  8. What is boilerplate code?
  9. When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]
  10. What does O(log n) mean exactly?
  11. What is Sliding Window Algorithm? Examples?
  12. Quicksort with Python
  13. how to implement quick sort algorithm in C++
  14. Python: maximum recursion depth exceeded while calling a Python object
  15. Why is the time complexity of both DFS and BFS O( V + E )
  16. Time complexity of a Priority Queue in C++
  17. What is stability in sorting algorithms and why is it important?
  18. Breadth First Search time complexity analysis
  19. Counting the sum of every nodes’ neighbors’ degrees?
  20. Time Complexity of the Kruskal Algorithm?
  21. Quick Sort Vs Merge Sort
  22. Polynomial time and exponential time
  23. Insertion Sort vs. Selection Sort
  24. Difference and advantages between dijkstra & A star
  25. Best Case for Bubble Sort
  26. How to find the kth smallest element in the union of two sorted arrays?
  27. Big O, how do you calculate/approximate it?
  28. Performing Breadth First Search recursively
  29. Is Quicksort in-place or not?
  30. longest increasing subsequence(O(nlogn))
  31. O(n log n) vs O(n) — practical differences in time complexity
  32. When should I use Kruskal as opposed to Prim (and vice versa)?
  33. Trying to understand max heapify
  34. Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
  35. Python Weighted Random [duplicate]
  36. What’s a good algorithm to generate a maze?
  37. Intuition for perceptron weight update rule
  38. Easy: Solve T(n)=T(n-1)+n by Iteration Method
  39. What is tail call optimization?
  40. PacMan: what kinds of heuristics are mainly used?
  41. Quicksort vs heapsort
  42. Big-oh vs big-theta
  43. Best case time complexity for selection sort
  44. Looking for algorithm finding euler path
  45. Trie complexity and searching
  46. What does this definition of contiguous subsequences mean?
  47. Is log(n!) = Θ(n·log(n))?
  48. Is complexity O(log(n)) equivalent to O(sqrt(n))?
  49. How to find maximum spanning tree?
  50. Exactly how many comparisons does merge sort make?
  51. Algorithm to return all combinations of k elements from n
  52. How to calculate big-theta
  53. What is the time complexity of while loops?
  54. Merge sort time and space complexity
  55. Intuitive explanation for why QuickSort is n log n?
  56. Calculate distance between two latitude-longitude points? (Haversine formula)
  57. Shuffle a deck of cards in Java
  58. How to calculate time complexity of backtracking algorithm?
  59. Median of Medians in Java
  60. Hash table runtime complexity (insert, search and delete)
  61. What is the difference between a heuristic and an algorithm?
  62. Which is better: O(n log n) or O(n^2)
  63. What is O(log* N)?
  64. Quickselect time complexity explained
  65. What is the proper equivalent of “while(true)” in plain C?
  66. Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?
  67. Asymptotic Notation – does n (log n) (log n) simplify?
  68. Difference between Big-O and Little-O Notation
  69. What is the big-O of the function (log n)^k
  70. How to calculate an angle from three points?
  71. Why is O(n) better than O( nlog(n) )?
  72. How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
  73. Is there an O(n) integer sorting algorithm?
  74. An example of Best Case Scenario for Quick Sort (Need someone to check if my answer is correct)
  75. how to write a recurrence relation for a given piece of code
  76. Why is merge sort worst case run time O (n log n)?
  77. Why is merge sort worst case run time O (n log n)?
  78. What is the time and space complexity of a breadth first and depth first tree traversal?
  79. Create your own MD5 collisions
  80. Image Segmentation using Mean Shift explained
  81. Finding the median of an unsorted array
  82. Difference between Big-Theta and Big O notation in simple language
  83. What is the difference between bucket sort and radix sort?
  84. How are the following functions O(N^3)?
  85. Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
  86. Finding all possible combinations of numbers to reach a given sum
  87. Are there any real O(n^n) algorithms?
  88. Sorting an array in C?
  89. Is Dijkstra’s algorithm for directed or undirected graphs?
  90. How to determine if a point is in a 2D triangle?
  91. Modular multiplicative inverse function in Python
  92. Minesweeper solving algorithm
  93. About bubble sort vs merge sort
  94. Dijkstra’s algorithm in python
  95. What exactly is the difference between “pass by reference” in C and in C++?
  96. What is the difference between memoization and dynamic programming?
  97. Why doesn’t Dijkstra’s algorithm work for negative weight edges?
  98. What is a “meta component” in the context of bootstrap or as a general web design term?
  99. Javascript: difference between a statement and an expression?
  100. Running time of algorithm A is at least O(n²) – Why is it meaningless?

Leave a Comment