% development of SELECTION SORT "algorithm"
% an "algorithm" is a procedure for solving a problem
% *** FOR HW 4 YOU ARE TO WRITE A BUBBLE SORT ***
clear all; clc
vec = [56;16;98;96;49;81;3;24]
[rows cols] = size(vec);
for startIndex = 1:rows-1
    lowVal = vec(startIndex); % initialize current low value
    lowValIndex = startIndex; % <<< MISSING LINE <<<
    for r = startIndex+1:rows
        if vec(r) < lowVal
            % remember r & change lowVal
            lowVal = vec(r); % optional, not used below
            lowValIndex = r;
        end
    end % end of searching down rows, for r = 1:rows
    % put lowVal in index 1 by swapping values
    if startIndex ~= lowValIndex
        tempSwapVar = vec(startIndex);
        vec(startIndex) = vec(lowValIndex);
        vec(lowValIndex) = tempSwapVar;
    end
    vec
end % end of for startIndex = 1:rows-1
vec