diff --git a/Classic algorithms/README.md b/Classic algorithms/README.md
index f36e03a..2f209db 100644
--- a/Classic algorithms/README.md	
+++ b/Classic algorithms/README.md	
@@ -7,3 +7,5 @@
 **Closest pair problem** - The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair of points with the smallest distance between them.
 
 **Sieve of Eratosthenes** - The sieve of Eratosthenes is one of the most efficient ways to find all of the smaller primes (below 10 million or so).
+**Backtracking** : Learn backtracking is a efficent way to learn how to build games like soduku and help u in solving many many problems.
+**Brute force** : A brute force algorithms is a way to devlop to find less bugs in the way and make sure that the code  passes through all the given test