Sorting Algorithms

Running head: SORTING ALGORITHMS
SORTING ALGORITHMS
Name of the Student
Name of the University
Author Note

1SORTING ALGORITHMS
Introduction:
In this particular assignment the objective is to implement different sorting algorithms in
MATLAB and measure their performances. Sorting is basically arranging a given dataset or
vector in either ascending or descending order. This can be performed by different ways or by
different algorithms. The algorithms are Selection sort, Bubble Sort, Insertion sort, Merge
sort, Quick sort, Heap sort, Counting sort, Radix sort, Bucket sort, Shell short, TimSort,
Comb Sort, Pigeonhole Sort, Cycle Sort, Cocktail Sort, Bitonic Sort, Pancake sorting, Gnome
Sort, Sleep Sort, Stooge Sort and more sorting techniques based on place of application are
being developed day by day. In this assignment the focus is on the primary two algorithms
which are Selection sort and Bubble sort which are implemented in MATLAB. Both sorting
are performed in ascending manner i.e. the display of the sorted data is in ascending order.
Selection sort Algorithm:
In this method first the minimum of the entire data row of size (n*1) and its position is
calculated. Then the minimum is swapped with the leftmost data point. Then this process is
repeated for data row of (n-1)*1 size i.e. process is continued with entire data except leaving
the leftmost data point. Finally, this iterative process ends with operation on the two right
most data points and data is sorted from left to right in ascending order.
MATLAB function for Selection sort:
function sorted = selectionsort(a)
%%%
% Performs sorting by Selection sorting algorithm on the given row vector.
% Input = User input array

2SORTING ALGORITHMS
% Output = Output array in ascending order
%%%
%a = [-5 1 4 -2 8 1 6 9 20 19]; % input vector of digits
sorted = a; % initializing sorted vector with a
for i=1:length(a)-1
[m,ipos] = min(sorted(i:length(a))); % extracting minimum and minimum index position
minipos = ipos + i-1; % adjusting minimum index position w.r.t vector A
%%% swapping betweeen found minimum and the number in ith position
%------
c = sorted(i); %
sorted(i) = sorted(minipos);
sorted(minipos) = c;
%------
end
end
Output with sample run:
a = [-5 1 4 -2 8 1 6 9 20 19];
>> sorted = selectionsort(a)
sorted =
-5 -2 1 1 4 6 8 9 19 20