update readme

anyaschukin · web-flow · commit 8a3f689ef259 · 2018-09-05T13:38:18.000+02:00
diff --git a/README.md b/README.md
@@ -4,11 +4,12 @@
 
 ## Challenge
 
-Sort a random list of integers (given via command line arguments), using the smallest number of moves, 2 stacks
+Sort a random list of integers using the smallest number of moves, 2 stacks
 and a limited set of operations. <br />
 <br />
 
-You start with two empty stacks: **a** and **b**. <br />
+You start with two empty stacks: **a** and **b**. You are given a random list of integers via command line arguments.
+<br />
 <br />
 
 Only these moves are allowed:
@@ -33,12 +34,13 @@ At the end, **stack b** must empty empty and all integers must be in **stack a**
 
 ## The Project
 You must create two programs: ```checker``` and ```push_swap```. <br />
-<br />
 
 The ```checker``` program reads a random list of integers from the stdin, stores them, and checks to see
 if they are sorted. <br />
+<br />
 The ```push_swap``` program calculates the moves to sort the integers &ndash; *pushing, popping, swapping* and *rotating* 
 them between **stack a** and **stack b** &ndash; and displays those directions on the stdout. <br />
+<br />
 You can pipe ```push_swap``` into ```checker```, and ```checker``` will verify that ```push_swap```'s instructions were successful. 
 <br />
 
