MCPcopy Create free account

hub / github.com/diptangsu/Sorting-Algorithms / functions

Functions423 in github.com/diptangsu/Sorting-Algorithms

⨍ Functions 423◇ Types & classes 58
↓ 39 callersFunctionprint
C/RadixSort.c:42
↓ 35 callersMethodprint
(int arr[], int n)
Java/RadixSort.java:63
↓ 25 callersMethodprint
A utility function to print an array
Kotlin/RadixSort.kt:73
↓ 14 callersFunctionswap
A utility function to swap two elements
Cpp/QuickSort.cpp:5
↓ 12 callersMethodprintSortingTime
(SortType sortType, int[] arr)
Java/AlgorithmComparison.java:48
↓ 10 callersMethodswap
* * @param arr * The array of elements for swap * @param x * One of the element for swap * @param y * Another element to
Kotlin/IntroSort.kt:97
↓ 7 callersMethodgetPlayer
(int i)
Java/TournamentSort.java:62
↓ 5 callersMethodgetWinners
(int root)
Java/TournamentSort.java:82
↓ 4 callersFunctionbubbleSort
A function to implement bubble sort
Cpp/BubbleSort.cpp:12
↓ 4 callersMethodgetLosers
(int root)
Java/TournamentSort.java:86
↓ 4 callersFunctionpartition
This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pi
Cpp/QuickSort.cpp:17
↓ 4 callersFunctionquickSort
The main function that implements QuickSort arr[] --> Array to be sorted, low --> Starting index, high --> Ending index */
Cpp/QuickSort.cpp:39
↓ 4 callersFunctionsort
C/BogoSort.c:22
↓ 4 callersMethodsort
(T[] v, Comparator<T> comparator)
Java/TournamentSort.java:19
↓ 3 callersMethodcompareSortingAlgorithms
(int arr[])
Java/AlgorithmComparison.java:32
↓ 3 callersFunctioncompare_algorithms
(numbers)
Python/AlgorithmComparisons.py:29
↓ 3 callersMethodheapSort
(int arr[])
Java/HeapSort.java:20
↓ 3 callersFunctionmerge
C/MergeSort.c:38
↓ 3 callersFunctionmergeSort
(arr)
JavaScript/mergeSort.js:3
↓ 3 callersMethodsort
Kotlin/CountingSort.kt:2
↓ 3 callersFunctionswap
global variable to check if swap() function is called
C/BubbleSort.c:4
↓ 3 callersFunctiontimeTaken
(algorithm string, arr []int)
Go/AlgorithmComparison.go:36
↓ 2 callersMethodRandomize
( int range )
Java/Bozosort.java:33
↓ 2 callersMethodbitonicSort
This is the Sorting function that iteratively sorts the array @param arr The array/sub-array to be sorted @param start Starting Index to condider
Java/BitonicSort.java:29
↓ 2 callersFunctionbubbleSort
Perform bubbleSort on every alternating element starting from 'start' Returns true if the alternating elements are sorted already, otherwise false.
Cpp/OddEvenSort.cpp:6
↓ 2 callersMethodbubbleSort
(int arr[])
Java/BubbleSort.java:22
↓ 2 callersFunctionbubble_sort
Author - Aditya Rana Generic Bubble Sort in rust
Rust/BubbleSort.rs:4
↓ 2 callersFunctionbucketSort
C/BucketSort.c:11
↓ 2 callersMethodcalcDepth
@param arr The array of elements @return The maximum recursion depth of array
Java/IntroSort.java:108
↓ 2 callersFunctioncocktail_sort
Author - Aditya Rana Generic Cocktail Sort in rust
Rust/CocktailSort.rs:4
↓ 2 callersFunctioncombSort
(arr)
Python/CombSort.py:14
↓ 2 callersMethodcombSort
(int[] arr)
Java/CombSort.java:22
↓ 2 callersMethodcompare
Kotlin/TournamentSort.kt:98
↓ 2 callersMethodcompare
(Integer a, Integer b)
Java/TournamentSort.java:139
↓ 2 callersMethodcompex
(int num1, int num2)
Java/Bozosort.java:41
↓ 2 callersFunctioncountSort
C/RadixSort.c:12
↓ 2 callersFunctioncounting_sort
counting sort for collections of u32 O(n + maxval) in time, where maxval is the biggest value an input can possibly take
Rust/CountSort.rs:5
↓ 2 callersFunctioncycleSort
* Sort an array in place and return the number of writes. */
C/CycleSort.c:10
↓ 2 callersMethodcycleSort
(int arr[], int n)
Java/CycleSort.java:15
↓ 2 callersFunctiondisplay
Cpp/ShellSort.cpp:10
↓ 2 callersFunctiondoFlip
C/PancakeSort.c:34
↓ 2 callersFunctionflip
(arr, i)
Python/PancakeSort.py:8
↓ 2 callersMethodflip
(int arr[], int i)
Java/PancakeSort.java:8
↓ 2 callersFunctiongetMax
C/RadixSort.c:3
↓ 2 callersFunctiongetNextGap
(gap float64)
Go/CombSort.go:5
↓ 2 callersMethodgnomeSort
Kotlin/GnomeSort.kt:33
↓ 2 callersMethodgnomeSort
(int arr[])
Java/GnomeSort.java:35
↓ 2 callersMethodheapAdjust
(int arr[], int i, int n)
Java/HeapSort.java:38
↓ 2 callersFunctionheapSort
main function to do heap sort
Cpp/HeapSort.cpp:32
↓ 2 callersMethodheapSort
Kotlin/HeapSort.kt:20
↓ 2 callersFunctionheap_sort
Generic Implementation of heap sort in rust
Rust/HeapSort.rs:3
↓ 2 callersFunctionheapify
To heapify a subtree rooted with node i which is an index in arr[]. n is size of heap
Cpp/HeapSort.cpp:7
↓ 2 callersFunctionheapify
(arr, n, root)
Python/HeapSort.py:7
↓ 2 callersFunctionheapify
(arr []int, i, n int)
Go/heapsort.go:36
↓ 2 callersFunctioninsertionSort
Cpp/Timsort.cpp:5
↓ 2 callersMethodinsertionSort
(int arr[])
Java/InsertionSort.java:22
↓ 2 callersFunctioninsertion_sort
Author - Aditya Rana Generic Insertion Sort in rust
Rust/InsertionSort.rs:4
↓ 2 callersMethodintroSort
@param arr The array of elements @param low The lowest array index to sort @param high The highest array index to sor
Java/IntroSort.java:35
↓ 2 callersMethodisPlayer
(int i)
Java/TournamentSort.java:116
↓ 2 callersFunctionmaxHeap
(input, i)
JavaScript/HeapSort.js:1
↓ 2 callersMethodmergeSort
(int arr[], int lower, int upper)
Java/MergeSort.java:20
↓ 2 callersFunctionminimum
(a, b int)
Go/timsort.go:68
↓ 2 callersFunctionmove_down
(arr: &mut [T], mut root: usize)
Rust/HeapSort.rs:19
↓ 2 callersFunctionprintArray
Cpp/OddEvenSort.cpp:40
↓ 2 callersFunctionprintArray
Cpp/Timsort.cpp:86
↓ 2 callersFunctionprintArray
Cpp/TimSort.cpp:91
↓ 2 callersFunctionprintArray
C/PancakeSort.c:47
↓ 2 callersMethodprintArray
(int arr[], int arr_size)
Java/PancakeSort.java:47
↓ 2 callersMethodprintSequence
(int[] sortedSequence)
Java/BucketSort.java:27
↓ 2 callersMethodprintSequence
(int[] sortedSequence)
Java/TimSort.java:24
↓ 2 callersMethodprintSequence
(int[] sortedSequence)
Java/GnomeSort.java:29
↓ 2 callersMethodquickSort
@param arr The array/sub-array to be sorted @param lower lower index @param upper upper index
Java/QuickSort.java:26
↓ 2 callersFunctionquick_sort
Author - Aditya Rana Generic Quick Sort in rust
Rust/QuickSort.rs:4
↓ 2 callersFunctionradixsort
The main function to that sorts arr[] of size n using Radix Sort
C/RadixSort.c:34
↓ 2 callersMethodrandomInts
(int n)
Java/TournamentSort.java:26
↓ 2 callersFunctionselectionSort
Cpp/SelectionSort.cpp:11
↓ 2 callersMethodselectionSort
(int arr[])
Java/SelectionSort.java:22
↓ 2 callersFunctionselection_sort
Implementation of Selection sort in rust
Rust/SelectionSort.rs:2
↓ 2 callersMethodsetMatch
(int root, int winner, int winners, int losers)
Java/TournamentSort.java:90
↓ 2 callersMethodsetWinner
(int root, int winner)
Java/TournamentSort.java:66
↓ 2 callersMethodsetWinners
(int root, int winners)
Java/TournamentSort.java:70
↓ 2 callersFunctionshellSort
Cpp/ShellSort.cpp:16
↓ 2 callersMethodshellSort
(int[] nums)
Java/ShellSort.java:21
↓ 2 callersFunctionshell_sort
Author - Aditya Rana Generic Shell Sort in rust
Rust/ShellSort.rs:4
↓ 2 callersFunctionshowArray
C/CycleSort.c:89
↓ 2 callersFunctionshuffle
C/BogoSort.c:12
↓ 2 callersMethodsort
Kotlin/TournamentSort.kt:106
↓ 2 callersMethodsort
The main method. @param array a generic collection to be sorted. @param left the begin of the order. @param right the end of the order.
Java/ThreeWayQuickSort.java:19
↓ 2 callersFunctionswap
(input, indexA, indexB)
JavaScript/HeapSort.js:15
↓ 2 callersMethodswap
Kotlin/ThreeWayQuickSort.kt:73
↓ 2 callersMethodswap
@param arr The array of elements for swap @param x One of the element for swap @param y Another element to swap
Java/IntroSort.java:96
↓ 2 callersMethodswap
(int[] array, int i, int j)
Java/OddEvenSort.java:41
↓ 2 callersMethodswap
The swap method. @param array a generic collection. @param i the index of the element that will be swapped with the j-element. @param j the index of
Java/ThreeWayQuickSort.java:72
↓ 2 callersMethodtime
(String description, Runnable action, InstrumentedCompare compare)
Java/TournamentSort.java:34
↓ 1 callersFunctionBubbleSort
(arr []int)
Go/bubblesort.go:22
↓ 1 callersFunctionBucketSort
(arr []int)
Go/bucketsort.go:22
↓ 1 callersFunctionHeapSort
(arr []int)
Go/heapsort.go:22
↓ 1 callersFunctionInsertionSort
(arr []int)
Go/insertionsort.go:22
↓ 1 callersFunctionMerge
A function to merge the two half into a sorted data.
Cpp/MergeSort.cpp:6
↓ 1 callersFunctionMergeSort
A function to split array into two parts.
Cpp/MergeSort.cpp:57
next →1–100 of 423, ranked by callers