Skip to content

Create Insertion sort algorithm #1811

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Hrishivite wants to merge 2 commits into from
Closed

Create Insertion sort algorithm #1811

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b2a5a6b
Create Insertion sort algorithm
Hrishivite Oct 16, 2020
a49a19b
Create Sleep sort algorithm
Hrishivite Oct 16, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 14 additions & 0 deletions Insertion sort algorithm
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
a[] is an array of size N
begin InsertionSort(a[])

for i = 1 to N
key = a[ i ]
j = i - 1
while ( j >= 0 and a[ j ] > key0
a[ j+1 ] = x[ j ]
j = j - 1
end while
a[ j+1 ] = key
end for

end InsertionSort
40 changes: 40 additions & 0 deletions Sleep sort algorithm
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
import java.util.concurrent.CountDownLatch;

public class SleepSort {
public static void sleepSortAndPrint(int[] nums) {
final CountDownLatch doneSignal = new CountDownLatch(nums.length);
for (final int num : nums) {
new Thread(new Runnable() {
public void run() {
doneSignal.countDown();
try {
doneSignal.await();

//using straight milliseconds produces unpredictable
//results with small numbers
//using 1000 here gives a nifty demonstration
Thread.sleep(num * 500);
System.out.println(num);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}).start();
}
}
public static void main(String[] args) {
int[] nums ={7, 3, 2, 1, 0, 5};
for (int i = 0; i < args.length; i++)
nums[i] = Integer.parseInt(args[i]);
sleepSortAndPrint(nums);
}
}