diff --git a/binary_search_rec.cpp b/binary_search_rec.cpp
index 348d845..61ef225 100644
--- a/binary_search_rec.cpp
+++ b/binary_search_rec.cpp
@@ -1,15 +1,16 @@
 // !/usr/bin/g++
 // Searches for an element using binary search
 #include <iostream>
+using namespace std;
 
 int binsearch(int *arr, int l, int r, int val)
 {
-	int mid = (l + (r - l)) / 2
+	int mid = ( (r - l)) / 2;
 	if (arr[mid] == val)
 		return mid+1;
 	if (l > r)
 		return -1;
-	if (arr[mid] >= var)
+	if (arr[mid] >= val)
 		binsearch(arr, mid+1, r, val);
 	else
 		binsearch(arr, l, mid-1, val);
@@ -17,17 +18,17 @@ int binsearch(int *arr, int l, int r, int val)
 
 int main()
 {
-	int t, n, var i;
+	int t, n, val, i;
 	cin >> t;
 	while (t--) {
 		cin >> n;
-		int a[n];
-		for (i = 0; i <= n; i++);
+		int arr[n];
+		for (i = 0; i < n; i++)
 			cin >> arr[i];
 
 		cin >> val;
-		cout << binsearch(a, 0, n, val); << endl;
+		cout << binsearch(arr, 0, n, val) << endl;
 	}
-}
+
 	return 0;
 }
diff --git a/hello.c b/hello.c
index 4a60883..657a9df 100644
--- a/hello.c
+++ b/hello.c
@@ -3,10 +3,10 @@
 /* The first program */
 // Hello world program
 
-#include <stdio>
+#include<stdio.h>
 
-intmain()
+int main()
 {
-        print("Hello World!\n")
-        retrn 0;
+        printf("Hello World!\n");
+        return 0;
 }
diff --git a/loop.py b/loop.py
index 6476288..4571bb4 100644
--- a/loop.py
+++ b/loop.py
@@ -1,7 +1,7 @@
 #!/usr/bin/python3
 # generate numbers within a given range 1 to n (including both)
 
-n = int(input()
+n = int(input());
 
 for i in range(1,n-1):
     print (i);
diff --git a/numtobase.cpp b/numtobase.cpp
index 879cdb9..22b837d 100644
--- a/numtobase.cpp
+++ b/numtobase.cpp
@@ -5,7 +5,7 @@
 #include <iostream>
 #include <string>
 #include <cmath>
-using namespace stdio;
+using namespace std;
 
 void numtobase(int num, int base)
 {
@@ -13,8 +13,8 @@ void numtobase(int num, int base)
 	string result;
 	if (num < 0)
 		cout << '-';
-	for (; num > 0; num; /= base);
-		resultinsert(result.begin(), digits[abs(num % base)]);
+	for ( ;num > 0; num /= base)
+		result.insert(result.begin(), digits[abs(num % base)]);
 	cout << result << endl;
 }
 
@@ -22,7 +22,7 @@ int main()
 {
 	int num, base;
 	cin >> num >> base;
-	numtobase(num, base)
+	numtobase(num, base);
 
 	return 0;
 }
diff --git a/sel-sort.cpp b/sel-sort.cpp
index 108fc0f..0c721fa 100644
--- a/sel-sort.cpp
+++ b/sel-sort.cpp
@@ -8,15 +8,17 @@ using namespace std;
 void sort(int *arr, int n)
 {
 	int i, j, temp, min;
-	for (i=1; i<n-1; i++) {
-		temp=arr[j];
+	for (i=0; i<n; i++) {
+	        
 		min = i;
 		for (j = i+1; j < n; j++) {
 			if (arr[min] > arr[j])
 				min = j;
 		}
-		arr[j] = arr[min];
-		arr[min] = tmp;
+		
+                temp=arr[i];
+		arr[i]=arr[min];
+arr[min]=temp;
 	}
 }
 
@@ -31,7 +33,7 @@ void printdata(int *arr,int n) {
 	for (int i=0;i<n;i++) {
 		cout << arr[i] << " " ;
 	}
-	cout << endl
+	cout << endl;
 }
 
 int main()
@@ -42,7 +44,7 @@ int main()
 		int n;
 		cin>>n;
 		int arr[n];
-		getdata(arr, n-1);
+		getdata(arr, n);
 		sort(arr, n);
 		printdata(arr, n);
 	}