Skip to content
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

InsertionSort: use index to compare instead undefined #231

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
+3 −4
Open

InsertionSort: use index to compare instead undefined #231

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
43090be
InsertionSort: use index to compare instead `undefined`
SidKwok Oct 21, 2018
f8a0ec8
InserationSort: fix lint
SidKwok Oct 21, 2018
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
Prev Previous commit
InserationSort: fix lint
@SidKwok
SidKwok committed Oct 21, 2018
commit f8a0ec8012f9aa736b3e2b094dc4d3afed600fee
3 changes: 2 additions & 1 deletion src/algorithms/sorting/insertion-sort/InsertionSort.js
View file
Original file line number Diff line number Diff line change
@@ -21,7 +21,8 @@ export default class InsertionSort extends Sort {
this.callbacks.visitingCallback(array[currentIndex - 1]);

// Swap the elements.
[array[currentIndex - 1], array[currentIndex]] = [array[currentIndex], array[currentIndex - 1]]
[array[currentIndex - 1], array[currentIndex]] = [
array[currentIndex], array[currentIndex - 1]];

// Shift current index left.
currentIndex -= 1;