From 0ac88474f3797572e17f3e083d13d638a159e7b8 Mon Sep 17 00:00:00 2001 From: nisarhassan12 Date: Wed, 21 Aug 2019 04:55:31 +0000 Subject: [PATCH 1/4] Added gitpod.io badge to the README --- README.md | 9 +++++++-- 1 file changed, 7 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 0ffc500b81f1..f49c7207efd2 100644 --- a/README.md +++ b/README.md @@ -4,6 +4,11 @@ NOTE: A [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch is made for this repo where we are trying to migrate the existing project to a Java project structure. You can switch to [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch for contributions. Please refer [this issue](https://github.com/TheAlgorithms/Java/issues/474) for more info. +Run, edit and contribute using Gitpod.io a free online dev environment. + +[![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/TheAlgorithms/Java) + + ### All algorithms implemented in Java (for education) These are for demonstration purposes only. There are many implementations of sorts in the Java standard library that are much better for performance reasons. @@ -28,7 +33,7 @@ __Properties__ ### Insertion ![alt text][insertion-image] -From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. +From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. In the figure, each bar represents an element of an array that needs to be sorted. What happens at the first intersection of the top most and second top most bars is to swap these elements, represented by bars, because the second element has a higher precedence than the first element does. By repeating this method, insertion sort completes sorting. __Properties__ @@ -121,7 +126,7 @@ __Properties__ * Worst case performance O(log n) * Best case performance O(1) * Average case performance O(log n) -* Worst case space complexity O(1) +* Worst case space complexity O(1) ##### View the algorithm in [action][binary-tutorialspoint] From 86078cfd27df2829f92c0d0aa3414ad9924bcaab Mon Sep 17 00:00:00 2001 From: nisarhassan12 Date: Wed, 21 Aug 2019 04:58:45 +0000 Subject: [PATCH 2/4] Updates README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index f49c7207efd2..d0eb20ae4593 100644 --- a/README.md +++ b/README.md @@ -4,7 +4,7 @@ NOTE: A [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch is made for this repo where we are trying to migrate the existing project to a Java project structure. You can switch to [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch for contributions. Please refer [this issue](https://github.com/TheAlgorithms/Java/issues/474) for more info. -Run, edit and contribute using Gitpod.io a free online dev environment. +You can playaround(run and edit) Algorithms and contribute to thwm using Gitpod.io a free online dev environment with a single click. No need to worry about the Dev enviroment. [![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/TheAlgorithms/Java) From f0ed93638e31dfb2a456d1d52ec03bac1b6b8670 Mon Sep 17 00:00:00 2001 From: Nisar Hassan Naqvi <46004116+nisarhassan12@users.noreply.github.com> Date: Wed, 21 Aug 2019 10:01:21 +0500 Subject: [PATCH 3/4] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d0eb20ae4593..d834e56ff59e 100644 --- a/README.md +++ b/README.md @@ -4,7 +4,7 @@ NOTE: A [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch is made for this repo where we are trying to migrate the existing project to a Java project structure. You can switch to [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch for contributions. Please refer [this issue](https://github.com/TheAlgorithms/Java/issues/474) for more info. -You can playaround(run and edit) Algorithms and contribute to thwm using Gitpod.io a free online dev environment with a single click. No need to worry about the Dev enviroment. +You can playaround (run and edit) with Algorithms or contribute to them using Gitpod.io a free online dev environment with a single click. No need to worry about the Dev enviroment. [![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/TheAlgorithms/Java) From 9994a6a58c8e75c72260cf081b72e26fcd63f86b Mon Sep 17 00:00:00 2001 From: Nisar Hassan Naqvi <46004116+nisarhassan12@users.noreply.github.com> Date: Wed, 21 Aug 2019 10:27:23 +0500 Subject: [PATCH 4/4] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d834e56ff59e..5277a698232c 100644 --- a/README.md +++ b/README.md @@ -4,7 +4,7 @@ NOTE: A [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch is made for this repo where we are trying to migrate the existing project to a Java project structure. You can switch to [Development](https://github.com/TheAlgorithms/Java/tree/Development) branch for contributions. Please refer [this issue](https://github.com/TheAlgorithms/Java/issues/474) for more info. -You can playaround (run and edit) with Algorithms or contribute to them using Gitpod.io a free online dev environment with a single click. No need to worry about the Dev enviroment. +You can playaround (run and edit) the Algorithms or contribute to them using Gitpod.io a free online dev environment with a single click. No need to worry about the Dev enviroment. [![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/TheAlgorithms/Java)