Creating N nested for-loops

by

You may use recursion instead with a base condition – 

void doRecursion(int baseCondition){

   if(baseCondition==0) return;

   //place your code here

   doRecursion(baseCondition-1);
}

Now you don’t need to provide the baseCondition value at compile time. You can provide it while calling the doRecursion() method.

More Related Contents:

  1. Algorithm (especially for c++) to show Every Permutation
  2. C++ throwing exception in recursive algorithm
  3. Can I use break to exit multiple nested ‘for’ loops?
  4. Howto create combinations of several vectors without hardcoding loops in C++?
  5. What’s time complexity of this algorithm for finding all combinations?
  6. How to find number of words in a phrase with spaces removed by checking v. dictionary
  7. Reflection and refraction impossible without recursive ray tracing?
  8. Is it possible to declare two variables of different types in a for loop?
  9. What is the efficient way to count set bits at a position or lower?
  10. Fast exact bigint factorial
  11. Generating combinations in c++
  12. How to find which elements are in the bag, using Knapsack Algorithm [and not only the bag’s value]?
  13. Lock-free Progress Guarantees in a circular buffer queue
  14. Finding duplicates in O(n) time and O(1) space
  15. Fast String Hashing Algorithm with low collision rates with 32 bit integer [closed]
  16. Emulate “double” using 2 “float”s
  17. Need for predictable random generator
  18. Iterative DFS vs Recursive DFS and different elements order
  19. Allow for Range-Based For with enum classes?
  20. Searching in a sorted and rotated array
  21. `std::list::sort()` – why the sudden switch to top-down strategy?
  22. Range based for-loop on array passed to non-main function
  23. How can I sort an STL map by value?
  24. Easiest way of using min priority queue with key update in C++
  25. What is the safe way to fill multidimensional array using std::fill?
  26. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  27. How to find and replace all occurrences of a substring in a string?
  28. Counting number of bits: How does this line work ? n=n&(n-1); [duplicate]
  29. Good C++ solutions to the “Bring all the zeros to the back of the array” interview challenge
  30. Order Statistic Tree in C++

Leave a Comment