Sort the given list of numbers a according to how far away each element is from the target value t. The result should return the list sorted in descending order of the absolute value of the difference between a(n) and t.
So if a = [1 2 4 8 17] and t = 12, then the output b should be [1 2 4 17 8].
Solution Stats
Problem Comments
5 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers4581
Suggested Problems
-
The Goldbach Conjecture, Part 2
2421 Solvers
-
3985 Solvers
-
Sum the numbers on the main diagonal
620 Solvers
-
947 Solvers
-
1795 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
quite easy
I bet
a nice practice.
I don't why this easy problem come at last.
Good one.