# Sort Command #4 – HackerRank Solution

In this post, we will solve Sort Command #4 HackerRank Solution. This problem (Sort Command #4) is a part of Linux Shell series.

Contents

You are given a file of text, where each line contains a number (which 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Â descendingÂ order – – such that the first line holds the (numerically) largest number and the last line holds the (numerically) smallest number.

## Input Format

A text file where each line contains a number as described above.

## Output Format

The text file, with lines re-ordered inÂ descendingÂ order (numerically).

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

``````66.6
62.1
55.6
47.4
46.6
44.6
43.7
43.5
42.7
9.3
9.2
9.1
4.7
4.6
4.5
4
2.3
2.2
2.1
2``````

## Solution – Sort Command #4 – HackerRank Solution

```#The text file, with lines re-ordered in descending order (numerically).
sort -n -r
```

Note: This problem (Sort Ccommand #4) is generated by HackerRank but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.