Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
43 lines (35 loc) · 952 Bytes

File metadata and controls

43 lines (35 loc) · 952 Bytes
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
35
36
37
38
39
40
41
42
43
package Algorithms;
import java.util.HashMap;
public class KthSort {
public static class Graph {
String name;
HashMap<Graph, Integer> subs;
public Graph(String name) {
this.name = name;
}
}
public static void main(String[] strs) {
// int[] input = new int[]{1,2,4,3,9,11,0};
// sort(input);
// for(int n: input) {
// System.out.print(n + " ");
// }
Graph c1 = new Graph("c1");
//for()
}
public static void sort(int[] input) {
if (input == null) {
return;
}
int len = input.length;
for (int i = 1; i < len; i++) {
int cur = input[i];
int j = i - 1;
while (j >= 0 && input[j] > cur) {
input[j + 1] = input[j];
j--;
}
input[j + 1] = cur;
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.