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

Bidirectional conditional insertion sort #68

Open
wants to merge 13 commits into
base: master
Choose a base branch
from
+1,675 −1,394
Open

Bidirectional conditional insertion sort #68

Changes from 1 commit
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
f1a7626
added Bidirectional Conditional Insertion Sort
Jun 13, 2018
5b598a8
Merge branch 'master' into master
christian4423 Jun 13, 2018
27cb6d0
cleaned up with eslint
Jun 13, 2018
181d468
Merge branch 'master' into master
christian4423 Jun 14, 2018
bfce00a
Passing eslist && npm test.
Jun 14, 2018
afc0888
Merge branch 'master' of https://github.com/christian4423/javascript-…
Jun 14, 2018
eff9f84
improved tests
Jun 14, 2018
87b3bcf
Working on getting tests to 100%
Jun 14, 2018
2ddf565
forgot to remove function
Jun 14, 2018
f230c85
made large arrays break
Jun 14, 2018
480e77f
Merge branch 'master' into master
christian4423 Jun 18, 2018
f97738c
Merge branch 'master' into master
christian4423 Jun 29, 2018
b9660c2
Merge branch 'master' into master
christian4423 Jul 2, 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
Next Next commit
improved tests
Christian Matsoukis committed Jun 14, 2018
commit eff9f84c2abf4a03b0b474dbb0a3b3aeeae112df
1 change: 1 addition & 0 deletions src/algorithms/sorting/bidirectional-conditional-insertion-sort/BCIS.js
View file
Original file line number Diff line number Diff line change
@@ -124,6 +124,7 @@ export default class BCIS extends Sort {
const RC = arr[SR];
do {
const currentItem = arr[i];
this.callbacks.visitingCallback(arr[i]);
if (comp.greaterThan(currentItem, RC)) {
arr[i] = arr[SR - 1];
arr = this.INSRIGHT(arr, currentItem, SR, right, comp);
8 changes: 4 additions & 4 deletions src/algorithms/sorting/bidirectional-conditional-insertion-sort/__test__/BCISort.test.js
View file
Original file line number Diff line number Diff line change
@@ -8,10 +8,10 @@ import {
} from '../../SortTester';

// Complexity constants.
const SORTED_ARRAY_VISITING_COUNT = 0;
const NOT_SORTED_ARRAY_VISITING_COUNT = 0;
const REVERSE_SORTED_ARRAY_VISITING_COUNT = 0;
const EQUAL_ARRAY_VISITING_COUNT = 0;
const SORTED_ARRAY_VISITING_COUNT = 26;
const NOT_SORTED_ARRAY_VISITING_COUNT = 20;
const REVERSE_SORTED_ARRAY_VISITING_COUNT = 26;
const EQUAL_ARRAY_VISITING_COUNT = 90;

describe('BCIS', () => {
it('should sort array', () => {