Insertion Sort in Octave (original) (raw)
Published on 09 December 2023 (Updated: 09 December 2023)
Welcome to the Insertion Sort in Octave page! Here, you'll find the source code for this program as well as a description of how the program works.
Current Solution
function insertion_sort()
%input validation
usage = 'Usage: please provide a list of at least two integers to sort in the format "1, 2, 3, 4, 5"';
arg_list = argv();
nargin = length(arg_list);
if nargin == 0
%if there was no input
disp(usage);
return;
end
array_string = arg_list{1};
array_size = sum(array_string == ',') + 1;
if array_size < 2
disp(usage);
return;
end
%build array
array = str2num(array_string);
if length(array) ~= array_size || any(mod(array, 1) ~= 0)
disp(usage);
return;
end
%insertion sort in ascending order
for i = 2:array_size
d = i;
while d > 1 && array(d) < array(d-1)
temp = array(d);
array(d) = array(d-1);
array(d-1) = temp;
d = d - 1;
end
end
%convert to string
result_string = num2str(array);
%replace space with ', '
result_string = regexprep(result_string, '\s+', ', ');
disp(result_string);
end
Insertion Sort in Octave was written by:
- rzuckerm
If you see anything you'd like to change or update, please consider contributing.
How to Implement the Solution
No 'How to Implement the Solution' section available. Please consider contributing.
How to Run the Solution
No 'How to Run the Solution' section available. Please consider contributing.