Selection sort P81602

Write a procedure

    void (vector<double>& v, int m);

that recursively sorts @v[0..m]@ in non-decreasing order using the selection sort algorithm. The rest of @v@ must not be modified.

Interface

void selection_sort(vector<double>& v, int m);

void selection_sort(double v[], int m);

public static void selectionSort(double[] v, int m);

selection_sort(v, m)  # returns None

selection_sort(v: list, m: int) -> None

Precondition

$-1 \le$ @m@ $<$ @v.size()@.

Observation

The function @position_maximum()@ of the exercise problem://problemsjutge.org:problems/p1/roura/posicio-maxim.pbm should be useful.

Observation

You only need to submit the required procedure; your main program will be ignored.