Recurrence Relation Find the time taken of this algorithm using a tracing tree and substitution method public static voi
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Recurrence Relation Find the time taken of this algorithm using a tracing tree and substitution method public static voi
Recurrence Relation Find the time taken of this algorithm using a tracing tree and substitution method public static void rec(int n) { if(n>1) { for(i=0; i<n; i++) { System.out.println(n); } rec(n-1); }
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!