diff --git a/C++/Algorithms/Sorting/BubbleSort.cpp b/C++/Algorithms/Sorting/BubbleSort.cpp
index 8ea567467..e9c64d177 100644
--- a/C++/Algorithms/Sorting/BubbleSort.cpp
+++ b/C++/Algorithms/Sorting/BubbleSort.cpp
@@ -25,7 +25,7 @@ int main() {
 	int arr[13] = {5, 4, 9, 123, 58, 37, 324, 444, 699, 347, -1, 0, 200};
 	int n = sizeof(arr) / sizeof(arr[0]);
 
-	bubblesort(arr, n, compare);
+	bubblesort(arr, n);
 
 	for (int i = 0; i < n; i++)
 		printf("%d ", arr[i]);
diff --git a/C++/Data Structure/reverseLinkedlist.cpp b/C++/Data Structure/reverseLinkedlist.cpp
new file mode 100644
index 000000000..6936d6e50
--- /dev/null
+++ b/C++/Data Structure/reverseLinkedlist.cpp	
@@ -0,0 +1,187 @@
+#include<bits/stdc++.h>
+using namespace std;
+class Node{
+    public:
+    int data;
+    Node*next;
+    Node(int data){
+        this->data=data;
+        next=NULL;
+    }
+};
+class Pair{
+    public:
+    Node* head;
+    Node* tail;
+};
+Pair reverseLL_2(Node* head){
+    if(head==NULL || head->next==NULL){
+        
+        Pair an;
+        an.head=head;
+        an.tail=head; 
+        return an;
+    }
+    Pair  ans=reverseLL_2(head->next);
+    ans.tail->next=head;
+    head->next=NULL;
+    Pair an;
+    an.head=ans.head;
+    an.tail=head;
+    return an;
+   
+}
+Node* reverseLL_Better(Node*head){
+    return reverseLL_2(head).head;
+    }
+Node* enterElement(Node* head){
+    
+    int data;
+    cin>>data;
+    Node* newNode=new Node(data);
+    if(head==NULL){
+        head=newNode;
+        return head;
+    }
+    Node* temp=head;
+    while (temp->next!=NULL)
+    {
+        temp=temp->next;
+    }
+    temp->next=newNode;
+    return head;
+    
+
+}
+Node* insertNode(Node* head){
+    cout<<"Enter the lenght of linked list you want to reverse"<<endl;
+    int lenght;
+    cin>>lenght;
+    cout<<"Enter data"<<endl;
+    for (int i = 0; i < lenght; i++)
+    {
+        head=enterElement(head);
+    }
+    return head;
+    
+}
+void print(Node *head){
+    while (head!=NULL)
+    {
+        cout<<head->data<<" ";
+        head=head -> next;
+    }
+    cout<<endl;
+}
+Node* reverseList(Node* head){
+    if(head==NULL || head->next==NULL){
+        return head;
+    }
+    Node* ans=reverseList(head->next);
+    Node* temp=ans;
+    while (temp->next!=NULL)
+    {
+        temp=temp->next;
+    }
+    temp->next=head;
+    head->next=NULL;
+    return ans;
+    
+}
+Node* reverseList_3(Node* head){
+    if(head==NULL || head->next==NULL){
+        return head;
+    }
+    Node* ans=reverseList(head->next);
+    Node* tail=head->next;
+    tail->next=head;
+    head->next=NULL;
+    return ans;
+    
+}
+Node* reverseLL_4(Node* head){
+    Node* cur=head;
+    Node* pre=NULL;
+    Node* next=cur;
+    if(head==NULL || head->next==NULL){
+        return head;
+    }
+    while (cur!=NULL)
+    {
+        next=cur->next;
+        cur->next=pre;
+        pre=cur;
+        cur=next;
+
+    }
+    head=pre;
+    return head;
+    
+}
+int main()
+{
+    Node* head=NULL;
+    head=insertNode(head);
+    cout<<"The entered linked list is "<<endl;
+    print(head);
+    back:
+    int input;
+    cout<<"Enter the method you want to use for reverse linkedlist"<<endl;
+    cout<<"Enter 1 for using recursion with time complixity of n^2"<<endl;
+    cout<<"Enter 2 for using recursion with time complixity of n and pair of return type using class"<<endl;
+    cout<<"Enter 3 for using recursion with time complixity of n using tail concept"<<endl;
+    cout<<"Enter 4 for using Iterative "<<endl;
+    cin>>input;
+    switch (input)
+    {
+    case 1:
+        {
+
+            head=reverseList(head);
+            cout<<"The reverse linked list is "<<endl;
+            print(head);
+            goto back;
+            break;
+        }
+    case 2:
+        {
+
+            head=reverseLL_Better(head);
+            cout<<"The reverse linked list is "<<endl;
+            print(head);
+            goto back;
+            break;
+        }   
+    case 3:
+        {
+
+            head=reverseList_3(head);
+            cout<<"The reverse linked list is "<<endl;
+            print(head);
+            goto back;
+            break;
+        } 
+    case 4:
+        {
+
+            head=reverseLL_4(head);
+            cout<<"The reverse linked list is "<<endl;
+            print(head);
+            goto back;
+            break;
+        } 
+    default:
+        break;
+    }
+    
+    
+   
+    
+ 
+    
+    
+    
+   
+  
+    return 0;
+}
\ No newline at end of file
diff --git a/Java/Algorithms/Arrays/PrefixSum Technique/ThreeEqualSum.java b/Java/Algorithms/Arrays/PrefixSum Technique/ThreeEqualSum.java
index d267ab90d..91bf9d071 100644
--- a/Java/Algorithms/Arrays/PrefixSum Technique/ThreeEqualSum.java	
+++ b/Java/Algorithms/Arrays/PrefixSum Technique/ThreeEqualSum.java	
@@ -28,11 +28,11 @@ public static boolean checkThreeEqualSum(int[] arr,int n){
 				splitCount++;
 		}
 		
-		return splitCount==3;
+		return splitCount;
 	}
 
 	public static void main(String args[]){
 		int arr[] = {2,2,2};
 		System.out.println(checkThreeEqualSum(arr,arr.length));
 	}
-}
\ No newline at end of file
+}
diff --git a/Java/Algorithms/BinarySearch/BinarySearch.java b/Java/Algorithms/BinarySearch/BinarySearch.java
index 623cc0e1d..6f4410eb8 100644
--- a/Java/Algorithms/BinarySearch/BinarySearch.java
+++ b/Java/Algorithms/BinarySearch/BinarySearch.java
@@ -39,7 +39,7 @@ static int binarySearch(int[] sortedArr,int target){
 				return mid;
 			}
 		}
-		return -1;
+		;
 
 	}
 
@@ -69,4 +69,4 @@ static int descendingBinarySearch(int[] arr,int target){
 	*/
 
 
-}
\ No newline at end of file
+}