first commit

Arrays-algos/reversearrayalgo2.cpp

@@ -0,0 +1,14 @@
+void reversearray2(int arr[],int size)
+{
+
+	int rev[size];
+	int j=0;
+	for(int i=size-1;i>=0;i++)
+	{
+		rev[j]=arr[i];
+		j++;
+	}
+
+	return rev;
+
+}

search-with-noob/binary_search.cpp

@@ -23,13 +23,25 @@ int binary_search(int array[], int search, int lower, int upper)
 //Since the Binary Search needs a sorted array but we have an unsorted array so it needs to be sorted first.
 //You can use any sorting method as per your convenience.
 
-int sort(int arr[],int search)
+int sort(int arr[],int search, int size)
 {
 
+  for (int step = 0; step < size - 1; ++step) 
+  {
+    for (int i = 0; i < size - step - 1; ++i) 
+	{
+      if (arr[i] > arr[i + 1]) 
+	  {
+        int temp = arr[i];
+        arr[i] = arr[i + 1];
+        arr[i + 1] = temp;
+      }
+    }  
+}
 
     // You have to sort the array and call the binary function and return the result you get from that function to the main.
 
-    int result = binary_search(sorted_array_name, search_element, initial_lower_value, initial_upper value );
+    int result = binary_search(arr, search, 0, size-1 );
     return result;
 }
 
@@ -41,7 +53,7 @@ int main()
   cout<<"Enter search element"<<endl;
   cin>>search;
   int size = sizeof(array) / sizeof(array[0]);
-  int result = sort(array, search);
+  int result = sort(array, search,size);
   if (result == -1)
     cout<<"Element not found"<<endl;
   else

search-with-noob/linear_search.cpp

@@ -18,13 +18,17 @@ int main()
 
     int search_element;
     //Take the input of the element to be searched by the user.
+	scanf("%d",&search_element);
 
 
     int result = linear_search(arr,size,search_element);
 
     //If the result is -1 then print that the element is not present in the array.
+	if(result==-1)
+		printf("element not found\n");
     //If the result is any value but -1 then print the element is found on that index.
-
+	else
+		printf("element found at index %d",result);
     return 0;
 
 }