Hello Programmers, In this post, you will know how to solve the Sort Command #3 HackerRank Solution. This problem is a part of the HackerRank Linux Shell Series.
One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.
Problem
In this challenge, we practice using the sort command to sort input in text or TSV formats.
You are given a text file where each line contains a number. The numbers may be either an integer or have decimal places. There will be no extra characters other than the number or the newline at the end of each line. Sort the lines in ascending order – so that the first line holds the numerically smallest number, and the last line holds the numerically largest number.
Input Format
A text file where each line contains a positive number (less than 100) as described above.
Output Format
Output the text file with the lines reordered in numerically ascending order.
Sample Input
9.1
43.7
2.2
62.1
2.1
9.3
43.5
4.6
44.6
4.7
42.7
47.4
46.6
4.5
55.6
4
9.2
66.6
2
2.3
Sample Output
2
2.1
2.2
2.3
4
4.5
4.6
4.7
9.1
9.2
9.3
42.7
43.5
43.7
44.6
46.6
47.4
55.6
62.1
66.6
Sort Command #3 HackerRank Solutions
#Output the text file with the lines reordered in numerically ascending order. sort -n
Note: This problem (Sort Command #3) is generated by HackerRank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.
