How do you write a function that will sort a one-dimensional array using looping and conditionals without using the sort or sortrow commands?
28 views (last 30 days)
Show older comments
In this problem, you are asked to write a function that will sort a one-dimensional array using looping and conditionals without using the sort or sortrow commands. Create a function called MySort.m, which takes as an input a 1-dimensional vector and sorts the values in a specifed order (ascending or descending). If no order is specifed, the default should be to sort in ascending order.
Function Header: function output = MySort(input, method)
The second input to the MySort, method, should be a string 'ascending' or 'descending'. If the function is called with only one argument, i.e. output = MySort(input), then the data in input should be sorted in ascending order. Hint: Use the variable nargin inside MySort and consider making use of the min and max functions and for or while when sorting.
% Test Cases
>> x = [1 5 3 5 2 10];
>> y1 = MySort(x,'ascending')
y1 =
1 2 3 5 5 10
>> y11 = MySort(x)
y11 =
1 2 3 5 5 10
>> y2 = MySort(x, 'descending')
y2 =
10 5 5 3 2 1
2 Comments
Matt J
on 8 Oct 2012
It looks like your MySort implementation is working correctly, given the test cases you've provided. What is the problem?
Accepted Answer
Sean de Wolski
on 8 Oct 2012
Edited: Sean de Wolski
on 8 Oct 2012
This oughtta do it. (And steal the win from Greg :) )
function v2 = MySort(v,direction)
[~,~,idx] = unique(v(:));
v2 = cell2mat(accumarray(idx,v(:),[],@(x){x}));
if nargin==2&&strcmp(direction,'descending')
v2 = flipud(v2);
end
for ii = 1
v2 = reshape(v2,size(v));
end
1 Comment
John D'Errico
on 8 Oct 2012
Well, it does use a loop, and it does have a test, and it does not explicitly call sort or sortrows. I gotta give it to Sean. :)
More Answers (3)
Greg Heath
on 8 Oct 2012
Edited: Greg Heath
on 8 Oct 2012
Find minx = min(x) at index indmin
x(indmax) = [];
y1 = [ y1 minx ];
Hope this helps enough so that you will formally accept my answer.
Greg
1 Comment
John D'Errico
on 8 Oct 2012
While this offers a poor scheme that can work when coupled with the proper logic, it must be made to work when the array has duplicates, which will take some careful logic. It is poor because it is terribly inefficient, doing far more tests than one should do in a sort. Note also that that this scheme has arrays that are constantly changing in size, so it will be an allocation nightmare.
Jose Canseco
on 8 Oct 2012
Edited: Jose Canseco
on 8 Oct 2012
2 Comments
John D'Errico
on 8 Oct 2012
But that won't sort the array. It won't even work properly to do what you think it does.
Sean de Wolski
on 8 Oct 2012
Here's a hint: assume it's 'ascending' and sort it this way. At the end, you can reverse it if you have to.
See Also
Categories
Find more on Loops and Conditional Statements in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!