Hi. I am familiar with the Quicksort algorithm in C which can sort an array of values in ascending or descending position. Is there any way of using the quicksort to find the smallest value in an array but this time to know what position that value was in the array prior to the ordering??
Last edited: