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

Not saying I invented an a new sorting algorithm, just implemented an improvement. This is the algorithm my professor dismissed me in front of the class. She said how can I prove it and don't ever said claiming this as mine. That's why it took a year to gain confidence once again, to share my solution online, after that shameful day, it left me sad for a while. Glad to hear comments. :D