FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
programming/recursion/java/PrintAllSubsequence.java at master · Scarlet-Coder/programming · GitHub
Scarlet-Coder
/
programming
Public
forked from
hacktoberfest17/programming
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
programming
/
recursion
/
java
/
PrintAllSubsequence.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
34 lines (29 loc) · 998 Bytes
Breadcrumbs
programming
/
recursion
/
java
/
PrintAllSubsequence.java
Copy path
File metadata and controls
34 lines (29 loc) · 998 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
// Java programe to print all subsequence of a given array.
public
class
PrintAllSubsequence
{
public
void
print
(
int
[]
input
) {
int
[]
output
=
new
int
[
input
.
length
];
for
(
int
i
=
0
;
i
<
input
.
length
;
i
++) {
output
[
0
] =
input
[
i
];
print
(
input
,
output
,
1
,
i
+
1
,
true
);
}
}
private
void
print
(
int
[]
input
,
int
[]
output
,
int
len
,
int
current
,
boolean
print
) {
if
(
print
) {
for
(
int
i
=
0
;
i
<
len
;
i
++) {
System
.
out
.
print
(
output
[
i
] +
" "
);
}
System
.
out
.
println
();
}
if
(
current
==
input
.
length
) {
return
;
}
output
[
len
] =
input
[
current
];
print
(
input
,
output
,
len
+
1
,
current
+
1
,
true
);
print
(
input
,
output
,
len
,
current
+
1
,
false
);
}
public
static
void
main
(
String
args
[]) {
PrintAllSubsequence
ps
=
new
PrintAllSubsequence
();
int
[]
input
= {
1
,
2
,
3
,
4
,
5
};
ps
.
print
(
input
);
}
}
Back
|
FazBrowse Home
|
New Git URL