-
Notifications
You must be signed in to change notification settings - Fork 0
/
print_all_Subarrays.java
79 lines (67 loc) · 1.39 KB
/
print_all_Subarrays.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
package matrix;
import java.util.*;
public class print_all_Subarrays{
public static Scanner ss=new Scanner(System.in);
public static Random rr=new Random();
//print array
public static void print(int arr[])
{
for(int i=0;i<arr.length-1;i++)
{
System.out.print(arr[i]+",");
}
System.out.print(arr[arr.length-1]);
System.out.println();
}
//printing all the subarrays-->Time complexity is O(n^3)
public static void subarray2(int arr[])
{
for(int i=0;i<arr.length;i++)
{
for(int j=i;j<arr.length;j++)
{
System.out.print("[");
for(int k=i;k<j;k++)
{
System.out.print(arr[k]+",");
}
System.out.print(arr[j]+"] ");
}
}
}
//time complexity of the array is O(n^2)
public static void subarray(int arr[],int l,int r)
{
if(r==arr.length)
{
return;
}
else if(l>r)
{
subarray(arr,0,r+1);
}
else
{
System.out.print("[");
for(int i=l;i<r;i++)
{
System.out.print(arr[i]+",");
}
System.out.print(arr[r]+"]");
subarray(arr,l+1,r);
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int n=ss.nextInt();
int arr[]=new int[n];
for(int i=0;i<arr.length;i++)
{
arr[i]=rr.nextInt(100);
}
print(arr);
subarray(arr,0,0);
System.out.println("\n \n");
subarray2(arr);
}
}