I was wonderind how you would take the psudocoede for repeat until and turn it into a do while statement in c++. Perferrably using a nested loop of some kind. Thanks

Divide-and-Conquer ALGORITHM HoarePartition(A[l..r]) Partitions a subarray by Hoare's algorithm, using the first element Il Input: Subarray of array AlO.n -1] defined by its left and right //Output: Partition of ?..rl, with the split position returned as as a pivot indices I and r (l P repeat j ? j-1 until A [j] p until i zj swap(?il. ??) swap(A[/], ALi]) return j //undo last swap when i j