public class DisplayArrayInReverse {
public static void main(String[] args) {
int[] arr = new int[]{1, 2, 3, 4, 5, 6};
reverse(arr, 0);
}
private static void reverse(int[] arr, int idx) {
// base case
if (idx == arr.length)
return;
// faith
reverse(arr, idx + 1);
// post order
System.out.println(arr[idx]);
}
}
Saturday, January 29, 2022
Display array in reverse
Subscribe to:
Post Comments (Atom)
Diagonal Traversal
eg. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Output: 1 6 11 16 2 7 12 3 8 4 Approach:...
-
I/P: 24 10 20 50 -1 60 -1 -1 30 70 -1 80 110 -1 120 -1 -1 90 -1 -1 40 100 -1 -1 -1 O/P: 10 20 30 40 50 60 70 80 90 100 110 120 import ja...
-
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ Given the sorted rotated array nums of unique elements, retu...
-
O(1) < O(log n) < O(n) < O(n log n) < O(n ^ 2) ..... < O(2 ^ n) < O(n!) Try to keep TC till O(n ^ 2) ====================...
No comments:
Post a Comment