What is the proper equivalent of “while(true)” in plain C?

Usually nowadays I see

while(1) {
    ...
}

It used to be common to see

for(;;) {
    ...
}

It all gets the point across.

Related Posts:

  1. Sorting an array in C?
  2. In a triangulated isometric grid, what triangle is a given point in?
  3. What is a loop invariant?
  4. What is a loop invariant?
  5. What does O(log n) mean exactly?
  6. how to calculate binary search complexity
  7. When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]
  8. What does O(log n) mean exactly?
  9. What is Sliding Window Algorithm? Examples?
  10. Quicksort with Python
  11. What is the difference between tree depth and height?
  12. how to implement quick sort algorithm in C++
  13. Python: maximum recursion depth exceeded while calling a Python object
  14. Why is the time complexity of both DFS and BFS O( V + E )
  15. Time complexity of a Priority Queue in C++
  16. What is stability in sorting algorithms and why is it important?
  17. Breadth First Search time complexity analysis
  18. Counting the sum of every nodes’ neighbors’ degrees?
  19. Time Complexity of the Kruskal Algorithm?
  20. Quick Sort Vs Merge Sort
  21. Polynomial time and exponential time
  22. Insertion Sort vs. Selection Sort
  23. Difference and advantages between dijkstra & A star
  24. Best Case for Bubble Sort
  25. How to find the kth smallest element in the union of two sorted arrays?
  26. Big O, how do you calculate/approximate it?
  27. Performing Breadth First Search recursively
  28. Is Quicksort in-place or not?
  29. longest increasing subsequence(O(nlogn))
  30. O(n log n) vs O(n) — practical differences in time complexity
  31. When should I use Kruskal as opposed to Prim (and vice versa)?
  32. Trying to understand max heapify
  33. Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
  34. Python Weighted Random [duplicate]
  35. What is the meaning of “exclusive” and “inclusive” when describing number ranges?
  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. hash function for string
  54. What is the time complexity of while loops?
  55. Merge sort time and space complexity
  56. Intuitive explanation for why QuickSort is n log n?
  57. Calculate distance between two latitude-longitude points? (Haversine formula)
  58. Shuffle a deck of cards in Java
  59. How to calculate time complexity of backtracking algorithm?
  60. Median of Medians in Java
  61. What is a loop invariant?
  62. Hash table runtime complexity (insert, search and delete)
  63. What integer hash function are good that accepts an integer hash key?
  64. Which is better: O(n log n) or O(n^2)
  65. What is O(log* N)?
  66. Quickselect time complexity explained
  67. Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?
  68. Asymptotic Notation – does n (log n) (log n) simplify?
  69. Difference between Big-O and Little-O Notation
  70. What is the big-O of the function (log n)^k
  71. How to calculate an angle from three points?
  72. Why is O(n) better than O( nlog(n) )?
  73. How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
  74. Is there an O(n) integer sorting algorithm?
  75. An example of Best Case Scenario for Quick Sort (Need someone to check if my answer is correct)
  76. how to write a recurrence relation for a given piece of code
  77. Why is merge sort worst case run time O (n log n)?
  78. Why is merge sort worst case run time O (n log n)?
  79. What is the time and space complexity of a breadth first and depth first tree traversal?
  80. Create your own MD5 collisions
  81. Image Segmentation using Mean Shift explained
  82. Finding the median of an unsorted array
  83. Difference between Big-Theta and Big O notation in simple language
  84. What is the difference between bucket sort and radix sort?
  85. How are the following functions O(N^3)?
  86. Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
  87. Finding all possible combinations of numbers to reach a given sum
  88. Are there any real O(n^n) algorithms?
  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. What is char ** in C?
  95. Why is volatile needed in C?
  96. error: indirection requires pointer operand (‘int’ invalid)
  97. C char* to int conversion
  98. C++ – include unistd.h: why not cunistd?
  99. Simple way to check if a string contains another string in C?
  100. C: pointer to array of pointers to structures (allocation/deallocation issues)

Leave a Comment