Merge pull request #71 from d2Anubis/master

updated readme

Author: larissalages

readme.md

@@ -2,7 +2,7 @@ Repository made with the aim to help people studing for coding interviews. All c
 
 Contributions are welcome! If you want to contribute, please read [CONTRIBUTING.md](https://github.com/larissalages/code_problems/blob/master/CONTRIBUTING.md) for details on how to get started and submit pull requests to us.
 
-# Usefull Links
+# Useful Links
 - [Big O cheat sheet](https://www.bigocheatsheet.com/)
 - [LeetCode](https://leetcode.com/)
 - [HackerRank](https://www.hackerrank.com/dashboard)
@@ -14,6 +14,10 @@ Contributions are welcome! If you want to contribute, please read [CONTRIBUTING.
 ### Python
 Code | Test
 ------------ | -------------
+[Heap Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/Heap%20Sort.py) | Missing tests
+[Kadane's Algorithm](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/kadanes_algorithm.py) | Missing tests
+[Linear Search](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/Linear%20Search%20.py) | Missing tests
+[Sieve of Eratoshenes](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/Sieve%20of%20Eratosthenes.py) | Missing tests
 [Quick Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/quicksort.py) | [Unit Test](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/tests/test_quick_sort.py)
 [Merge Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/mergesort.py) | [Unit Test](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/tests/test_merge_sort.py)
 [Radix](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/python/radix.py) | [Unit Test](https://github.com/larissalages/code_problems/blob/f0353fac71e3b773dbfb12080c01b02baa35ac72/classical_algorithms/python/tests/test_radix.py)
@@ -25,16 +29,53 @@ Code | Test
 ------------ | -------------
 [Merge Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/java/MergeSort.java) | Missing tests
 [Quick Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/java/QuickSort.java) | Missing tests
+[Bubble Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/java/BubbleSort.java) | Missing tests
 
 ### C++
 Code | Test
 ------------ | -------------
+[Binary Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/binary_tree.cpp) | Missing tests
+[Prims Algo](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/prims_algo.cpp) | Missing tests
 [Selection Sort](https://github.com/kartikeysingh6/code_problems/blob/master/classical_algorithms/c%2B%2B/selectionsort.cpp) | Missing tests
 [Insertion Sort](https://github.com/kartikeysingh6/code_problems/blob/master/classical_algorithms/c++/insertionsort.cpp) | Missing tests
 [Bubble Sort](https://github.com/kartikeysingh6/code_problems/blob/master/classical_algorithms/c++/bubblesort.cpp) | Missing tests
 [Merge Sort](https://github.com/larissalages/code_problems/blob/master/classical_algorithms/c%2B%2B/mergesort.cpp) | Missing tests
 [Quick Sort](https://github.com/kartikeysingh6/code_problems/blob/master/classical_algorithms/c++/quicksort.cpp) | Missing tests
 
+#Codeforces
+
+### Round 633
+Problem Statement | Solution
+------------ | -------------
+[A](https://codeforces.com/contest/1339/problem/A) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/2_Round_633_Div_2/A.cpp)
+[B](https://codeforces.com/contest/1339/problem/B) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/2_Round_633_Div_2/B.cpp)
+[C](https://codeforces.com/contest/1339/problem/C) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/2_Round_633_Div_2/C.cpp)
+### Round 634
+Problem Statement | Solution
+------------ | -------------
+[A](https://codeforces.com/contest/1335/problem/A) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/1_Round_634_Div_3/A.cpp)
+[B](https://codeforces.com/contest/1335/problem/B) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/1_Round_634_Div_3/B.cpp)
+[C](https://codeforces.com/contest/1335/problem/C) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/1_Round_634_Div_3/C.cpp)
+[D](https://codeforces.com/contest/1335/problem/D) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/1_Round_634_Div_3/D.cpp)
+### Round 635
+Problem Statement | Solution
+------------ | -------------
+[A](https://codeforces.com/contest/1337/problem/A) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/4_Round_635_Div_2/A.cpp)
+[B](https://codeforces.com/contest/1337/problem/B) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/4_Round_635_Div_2/B.cpp)
+### Round 636
+Problem Statement | Solution
+------------ | -------------
+[A](https://codeforces.com/contest/1343/problem/A) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/5_Round_636_Div_3/A.cpp)
+[B](https://codeforces.com/contest/1343/problem/B) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/5_Round_636_Div_3/B.cpp)
+[C](https://codeforces.com/contest/1343/problem/C) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/5_Round_636_Div_3/C.cpp)
+[D](https://codeforces.com/contest/1343/problem/D) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/5_Round_636_Div_3/D.cpp)
+### Round 637
+Problem Statement | Solution
+------------ | -------------
+[A](https://codeforces.com/contest/1341/problem/A) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/6_Round_637_Div_2/A.cpp)
+[B](https://codeforces.com/contest/1341/problem/B) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/6_Round_637_Div_2/B.cpp)
+[C](https://codeforces.com/contest/1341/problem/C) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/6_Round_637_Div_2/C.cpp)
+
 # LeetCode
 ## Binary Search Trees
 Challenge | Solution