FilesExpand file tree

 master

/

recursive-insertionsort.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

47 lines (43 loc) · 1.35 KB

 master

/

recursive-insertionsort.js

Copy path

Top

File metadata and controls

• Code
• Blame

47 lines (43 loc) · 1.35 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

(function (exports) {

'use strict';

function compare(a, b) {

return a - b;

}

/**

* Recursive version of insertion sort.<br><br>

* Time complexity: O(N^2).

*

* @example

*

* var sort = require('path-to-algorithms/src/sorting/'+

* 'recursive-insertionsort').recursiveInsertionSort;

* console.log(sort([2, 5, 1, 0, 4])); // [ 0, 1, 2, 4, 5 ]

*

* @public

* @module sorting/recursive-insertionsort

* @param {Array} array Input array.

* @param {Function} cmp Optional. A function that defines an

* alternative sort order. The function should return a negative,

* zero, or positive value, depending on the arguments.

* @param {Number} max Optional. Index of the element which place

* we should find in the current function call.

* @return {Array} Sorted array.

*/

function recursiveInsertionSort(array, cmp, max) {

cmp = cmp || compare;

if (max === undefined) {

max = array.length - 1;

}

if (max <= 0) {

return array;

}

recursiveInsertionSort(array, cmp, max - 1);

for (var i = max - 1, current = array[max];

i >= 0 && cmp(current, array[i]) < 0; i -= 1) {

array[i + 1] = array[i];

}

array[i + 1] = current;

return array;

}

exports.recursiveInsertionSort = recursiveInsertionSort;

})(typeof window === 'undefined' ? module.exports : window);