Global

Members

queue :Array.<number>

Source:
Type:
  • Array.<number>

Methods

basicRecursion(current, max)

Source:
Parameters:
Name Type Description
current number The current number provided
max number the max number provided

bubbleSort(arr) → {Array.<number>}

Source:
Parameters:
Name Type Description
arr Array.<number> array to sort
Returns:
Type:
Array.<number>
- shorted array

bubbleSort2(arr) → {Array.<number>}

Source:
Parameters:
Name Type Description
arr Array.<number> array to sort
Returns:
Type:
Array.<number>
- shorted array

factorial(n) → {number}

Source:
Parameters:
Name Type Description
n number the number
Returns:
Type:
number
- the factorial of given number n
Example
factorial(5) => 120

fibonacci(n) → {number}

Source:
Parameters:
Name Type Description
n number the nth fibonachi number
Returns:
Type:
number
nth fibonachi number
Example
fibonachi(6) => 8

insertionSort(arr) → {Array.<number>}

Source:
Parameters:
Name Type Description
arr Array.<number> array of nums
Returns:
Type:
Array.<number>
sorted arr

mergeSort(arr) → {Array.<numeber>}

Source:
Parameters:
Name Type Description
arr Array.<number> array of numbers to sort
Returns:
Type:
Array.<numeber>
sorted array

quickSort(arr) → {Array.<numeber>}

Source:
Parameters:
Name Type Description
arr Array.<number> array of numbers to be sorted
Returns:
Type:
Array.<numeber>
sorted array

stitch(left, right) → {Array.<number>}

Source:
Parameters:
Name Type Description
left Array.<number>
right Array.<number>
Returns:
Type:
Array.<number>
stitched array