updated readme and travis file

Author: aladdinpersson

.travis.yml

@@ -22,8 +22,10 @@ install:
     - pip3 install pytest-cov
     - pip3 install codecov
 
-script: pytest --cov=Algorithms/
-     # - awesome_bot README.md --allow-dupe --allow-redirect
+script: 
+    #- awesome_bot README.md --allow-dupe --allow-redirect
+    - pytest --cov=Algorithms/
+    
      # # Dynamic Programming Tests
      # - python Algorithm_tests/dynamic_programming_tests/knapsack_tests/knapsack_bottomup_test.py
      # - python Algorithm_tests/dynamic_programming_tests/sequence_alignment/sequence_alignment_test.py

README.md

@@ -55,7 +55,7 @@ Whenever I face an interesting problem I document the algorithm that I learned t
 * :white_check_mark: [Maintaining Median](https://github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/other/median_maintenance.py) **- O(nlog(n))**
 * :small_red_triangle: [Huffman Algorithm](https://github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/other/Huffman/Huffman.py)
 * :white_check_mark: [:movie_camera:](https://youtu.be/SmPxC8m0yIY)[Interval Scheduling](https://github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/other/interval_scheduling.py) **- O(nlog(n))**
-* :white_check_mark: [Binary Search](https://github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/search/binarysearch.py) **- O(log(n))** 
+* :white_check_mark: [Binary Search](https://github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/other/binarysearch.py) **- O(log(n))** 
 
 # Sorting algorithms
 *  :white_check_mark: [Bubble sort](https://github.com/AladdinPerzon/Algorithms-Collection-Python/blob/master/Algorithms/sorting/bubblesort.py) **- O(n<sup>2</sup>)**