* Update the names to make ES5 and ES6 solutions more consistent
I basically change the names to make the function more explicit and clear:
1. list to sortedList
2. mid to middle
* Revert "Update the names to make ES5 and ES6 solutions more consistent"
This reverts commit 46d7514636420eb3b3c581665eaa3c0aca9df99d.
* [selection sort] update Js (ES5, ES6) to make them more consistent and explicit
* Update 01_selection_sort.py
Updated last print statement for Python 3 print function.
* Update 01_countdown.py
Updated print statement to print function for Python 3.
* Update 05_quicksort.py
Updated print statement to print function for Python 3.
* Update 01_price_of_groceries.py
Condensed dictionary creation into one line, edited print statement to a print function for Python 3.
* Update 01_set_covering.py
Changed print statement to print function for Python 3.
* Update 01_binary_search.py
Changed print statements to print function for Python 3.
* Adding binary search example for Haskell
* Adding selection sort example in Haskell
* Adding Haskell examples for chapter 3
* Adding examples for chapter 4
* Adding examples for chapter 5
* Adding git ignore
* Add Haskell example for BFS
* resetting
* Adding haskell example for dijkstras algorithm
* Adding Haskell example for chapter 8
* Adding power set based solution for set covering problem
* Adding Haskell examples for chap 9
* add ES6 example for binary search
* add ES6 example for selection sort
* add ES6 example for countdown
* add ES6 example for greet
* add ES6 example for factorial
* edit ES6 example for quicksort
* add ES6 example for loop sum
* add ES6 example for recursive sum
* add ES6 example for recursive count
* add ES6 example for recursive max
* add ES6 example for price of groceries
* add ES6 example for check voter
* add ES6 example for breadth-first search
* add ES6 example for dijkstras algorithm
* edit ES6 example for dijkstras algorithm
* edit ES6 example for set covering
* add ES6 example for longest common subsequence
* Adding binary search example for Haskell
* Adding selection sort example in Haskell
* Adding Haskell examples for chapter 3
* Adding examples for chapter 4
* Adding examples for chapter 5
* Adding git ignore
* Add Haskell example for BFS
old version of sort with array was with mistake in array size in line 7. Also findSmallest method each time accepted array with already finded smallest
* code for chapters 3-9 in Java
* code for chapters 1 in Java
* code for chapter 2 in Java
* missing CheckVoter for chapter 5 in Java
* add missing sample output for SetCovering as a comment
* 01_binary_search Swift 3.0.2
* 01_binary_search Swift 3.0.2
* add Chapter 2 - 01_selection_sort Swift 3.0.2 example
* 01_binary_search cosmetic note updates Swift 3.0.2
* 03_recursion Swift 3.0.2 examples
* 04_quicksort Swift 3.0.2 examples
* fix typo on quicksort example. Swift 3.0.2
* add 05_hash_tables examples on Swift 3.0.2
* add 01_breadth-first_search Swift 3.0.2 example
* 01_breadth-first_search fixing typo Swift 3.0.2
* add 01_dijkstras_algorithm on Swift 3.0.2
* add 08_greedy_algorithms Swift 3.0.2 example
* 01_longest_common_subsequence Swift 3.0.2 example
