Skip to content

update README style and fixed minor issues #591

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

Merged
merged 1 commit into from
Dec 12, 2018
Merged

update README style and fixed minor issues #591

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
17 changes: 9 additions & 8 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# The Algorithms - Java

## 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.
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.

### All algorithms implemented in Java (for education)

Expand All @@ -19,7 +19,7 @@ __Properties__
* Best case performance O(n)
* Average case performance O(n^2)

###### View the algorithm in [action][bubble-toptal]
##### View the algorithm in [action][bubble-toptal]



Expand All @@ -34,7 +34,7 @@ __Properties__
* Best case performance O(n)
* Average case performance O(n^2)

###### View the algorithm in [action][insertion-toptal]
##### View the algorithm in [action][insertion-toptal]


### Merge
Expand All @@ -48,7 +48,7 @@ __Properties__
* Average case performance O(n log n)


###### View the algorithm in [action][merge-toptal]
##### View the algorithm in [action][merge-toptal]

### Quick
![alt text][quick-image]
Expand All @@ -60,7 +60,7 @@ __Properties__
* Best case performance O(n log n) or O(n) with three-way partition
* Average case performance O(n^2)

###### View the algorithm in [action][quick-toptal]
##### View the algorithm in [action][quick-toptal]

### Selection
![alt text][selection-image]
Expand All @@ -72,7 +72,7 @@ __Properties__
* Best case performance O(n^2)
* Average case performance O(n^2)

###### View the algorithm in [action][selection-toptal]
##### View the algorithm in [action][selection-toptal]

### Shell
![alt text][shell-image]
Expand All @@ -84,7 +84,7 @@ __Properties__
* Best case performance O(n log n)
* Average case performance depends on gap sequence

###### View the algorithm in [action][shell-toptal]
##### View the algorithm in [action][shell-toptal]

### Time-Compexity Graphs

Expand Down Expand Up @@ -119,14 +119,15 @@ __Properties__
* Average case performance O(log n)
* Worst case space complexity O(1)

### Shell
From [Wikipedia][shell-wiki]: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywhere, considering every nth element gives a sorted list. Such a list is said to be h-sorted. Equivalently, it can be thought of as h interleaved lists, each individually sorted.

__Properties__
* Worst case performance O(nlog2 2n)
* Best case performance O(n log n)
* Average case performance depends on gap sequence

###### View the algorithm in [action][shell-toptal]
##### View the algorithm in [action][shell-toptal]

[bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort
[bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort
Expand Down