Skip to content

Sombrero Galaxy

Latest
Latest
Compare
Choose a tag to compare
@iamwill123 iamwill123 released this 01 Jul 16:34
· 54 commits to main since this release
1.0.57
7be84ec

List of current available algorithms

  generateRandomNumbers,
  nativeSort,
  bubbleSort,
  selectionSort,
  insertionSort,
  mergeSort,
  quickSort,
  heapSort,
  countSort,
  nCk,
  fibonacci,
  factorial,
  towerOfHanoi,
  generateAllBinaryStringsOfLenN,
  mergeTwoSortedArrIntoOne,

  1. generateRandomNumbers: This function is used to generate a sequence of random numbers. The sequence can be uniformly distributed or follow some other statistical distribution, depending on the specific requirements of the task.

  2. nativeSort: This is a built-in function in many programming languages that sorts a list or array. The specific algorithm used can vary but often includes efficient algorithms such as Quicksort, Mergesort, or Heapsort.

  3. bubbleSort: Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.

  4. selectionSort: Selection Sort is a simple sorting algorithm that sorts an array by repeatedly finding the minimum element from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.

  5. insertionSort: Insertion sort is a simple sorting algorithm that works similarly to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted region. Values from the unsorted region are picked and placed at the correct position in the sorted region.

  6. mergeSort: Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.

  7. quickSort: QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways.

  8. heapSort: HeapSort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element and place the maximum element at the end.

  9. countSort: Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values. Then doing some arithmetic to calculate the position of each object in the output sequence.

  10. nCk (Combinations): This algorithm calculates the number of combinations of n items taken k at a time. It often uses the factorial function in its calculation.

  11. fibonacci: This algorithm generates the Fibonacci sequence, where each number is the sum of the two preceding ones, usually starting with 0 and 1.

  12. factorial: The factorial algorithm multiplies a given number by every number less than it down to 1. It's typically denoted as n!.

  13. towerOfHanoi: The Tower of Hanoi is a mathematical game or puzzle. The algorithm for solving the Tower of Hanoi puzzle with any number of disks takes advantage of recursion.

  14. generateAllBinaryStringsOfLenN: This algorithm generates all binary strings of length n. This is a common task in combinatorics and computer science.

  15. mergeTwoSortedArrIntoOne: This function merges two already sorted arrays/lists into a single sorted array/list. This operation is the heart of the merge sort algorithm.

What's Changed

Full Changelog: 1.0.46...1.0.57

Contributors

iamwill123 and dependabot
Assets 2
Loading