From f1e69fd3f793c6bf146f9398057615c868a7322f Mon Sep 17 00:00:00 2001
From: Jyoti Singla <56391719+jyotisingla08@users.noreply.github.com>
Date: Mon, 4 Oct 2021 16:44:10 +0530
Subject: [PATCH 1/2] Update reverse.java

---
 Java/reverse.java | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Java/reverse.java b/Java/reverse.java
index 90c2217..a7be730 100644
--- a/Java/reverse.java
+++ b/Java/reverse.java
@@ -5,8 +5,10 @@ public static void main(String args[])
     {
         Scanner scan=new Scanner(System.in);
         int n=scan.nextInt();
+        //Input integers
         Stack<Integer> s=new Stack<Integer>();
         int digit,count=0;
+        //Add to stack
         while(n!=0)
         {
             digit=n%10;

From a16924f713f610116f3d23fa2971e625b5c309bc Mon Sep 17 00:00:00 2001
From: Jyoti Singla <56391719+jyotisingla08@users.noreply.github.com>
Date: Mon, 4 Oct 2021 17:04:52 +0530
Subject: [PATCH 2/2] Update binary_search.C

---
 C/binary_search.C | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/C/binary_search.C b/C/binary_search.C
index 32d3f9e..cd7fe7d 100644
--- a/C/binary_search.C
+++ b/C/binary_search.C
@@ -9,6 +9,7 @@ int main()
     {
         scanf("%d", &a[i]);
     }
+    //sort the elements
     for(i=0;i<n;i++)
     {
         for(j=i+1;j<n;j++)
@@ -29,6 +30,7 @@ int main()
     scanf("%d", &search);
     beg=0;
     end=n-1;
+    //find middle element
     mid=(beg+end)/2;
     while(beg<=end)
     {