Sorting parallel arrays in C++

[razzle]

I am not able to get the arrays to sort and match up correctly..

You don't have to sort to find the min (or max) element of an array.

You note the first element as the current min candidate. Then you scan the array and for each element check whether it's smaller than the min candidate. If so it becomes the new min candidate. When the scan finishes the min candidate is the smallest element of all.

So finding min or max can always be done in just one scan of an array. This is not true for sorting (if you find a way just book a ticket to Stockholm to pick up your Nobel prize ) and that's why I can tell right away the "sorting" in findLowest doesn't work. If it seems to it's just accidental luck.

Finding an extreme element is O(N) whereas sorting is O(N * logN).