Tutorial 223 | Price profile

The method performs a manual sort on two parallel vectors:

Keys[] – strings

and Vals[] – doubles

These vectors represent the keys and values of a Dictionary, but once extracted into arrays they must be
sorted manually. The method sorts them in descending order by value while keeping keys and values aligned.

Step-by-Step Description
1. Two nested loops
For Ctr1 = 0 to Keys.Count – 1
For Ctr2 = Ctr1 + 1 to Keys.Count – 1

Ctr1 marks the current position we want to fill with the next largest value.

Ctr2 scans through the remaining elements to find any value larger than the one at Ctr1.

This is essentially a selection sort structure.

2. Compare values
If Vals[Ctr1] < Vals[Ctr2] then

If a later element (Ctr2) has a larger value than the current element (Ctr1), you need to swap them.
This ensures the largest values “bubble” toward the front, creating descending order.

3. Swap both vectors in sync

Because each key corresponds to its value, both arrays must be swapped together:

TmpKey = Keys[Ctr1];
TmpVal = Vals[Ctr1];

Keys[Ctr1] = Keys[Ctr2];
Vals[Ctr1] = Vals[Ctr2];

Keys[Ctr2] = TmpKey;
Vals[Ctr2] = TmpVal;

This keeps the key-value association intact after sorting.

Why it Works
============

The double loop checks every possible pair where the second index is ahead of the first.

Whenever a larger value is found, the pair is swapped to move the larger value forward.

Because every element is compared with all elements after it, the final result is fully sorted.

This is functionally a descending selection sort applied to two synchronized vectors.