MinMAX Sort – A Stable Bidirectional Selection Sort Family Algorithm
MinMAX Sort – A Stable Bidirectional Selection Sort Family Algorithm
Repository: https://github.com/tsuJack-Devs/minMAX-Sorting-Algorithm/tre... I made a sorting algorithm last year out of curiosity and hobby not knowing that this was actually a selection sort variant. It still has outer and inner loop but, half of the operations than the traditional selection sort or O(n^2) sorting algorithm variants. Making outer loop n/2 smaller and inner loop is (n x n)/2 smaller as well. This is well tested with a lot of number arrangements like cliff, spike, reverse, duplicates, and any possible chaotic array of numbers. Kinda crazy to promoting an improved selection sort algorithm but yeah, made it with passion of CS. :D
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Correct prediction on native model
Similar products
TDD Screencast #2: Implementing Sort
Cluster-Sort
Visualization of the Marriage Sort algorithm
QuadSort, Esoteric Fast Sort
Faster than std:sort and pdqsort
YouTube Sort by Likes
hist: An overengineered solution to `sort|uniq -c` with 25x throughput
vim-sort-folds – Sort vim folds based on their first line
Sort Foods and Recipes by Nutrient and Caloric Density
ABCSS – Sort your css properties alphabetically