From fdcc4e7f7ea23fb1e43db197ae969a418e463ef5 Mon Sep 17 00:00:00 2001
From: Ahmed <92481567+Ahmed-Shahzad10@users.noreply.github.com>
Date: Wed, 10 Jul 2024 22:32:25 +0500
Subject: [PATCH] Update README.md

---
 README.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 343480ce0..ff2a5db25 100644
--- a/README.md
+++ b/README.md
@@ -86,6 +86,9 @@ Numbers
 
 **Fast Exponentiation** - Ask the user to enter 2 integers a and b and output a^b (i.e. pow(a,b)) in O(lg n) time complexity.
 
+**Binary Code Guess** - The The user has a secret code composed of n bits (each bit is either '0' or '1'). The program attempts to determine this secret code by iteratively guessing and refining its guesses 
+based on feedback from the user.
+
 Classic Algorithms
 -----------------
 
@@ -97,7 +100,6 @@ Classic Algorithms
 
 **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).
 
-
 Graph
 --------