From 910653066d30ee61c9cec4137855e470b4933438 Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:11:27 +0530 Subject: [PATCH 1/7] Update binary_search_rec.cpp --- binary_search_rec.cpp | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) 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 +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; } From 03abbce1b3678176cb010a88abb5534d2ba994e9 Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:11:42 +0530 Subject: [PATCH 2/7] Update binary_search_rec.cpp From 1522de5f5d83ddd4598fc4dfbd8c58ce532cbd43 Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:12:23 +0530 Subject: [PATCH 3/7] Update hello.c --- hello.c | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) 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 +#include -intmain() +int main() { - print("Hello World!\n") - retrn 0; + printf("Hello World!\n"); + return 0; } From 94eba5b3e198919114f1689d2178d0e6f87a7a2b Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:12:50 +0530 Subject: [PATCH 4/7] Update loop.py --- loop.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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); From e25cf42b8ab8c7c0b1850b1af67ea7768dfb45cf Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:13:13 +0530 Subject: [PATCH 5/7] Update numtobase.cpp --- numtobase.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/numtobase.cpp b/numtobase.cpp index 879cdb9..22b837d 100644 --- a/numtobase.cpp +++ b/numtobase.cpp @@ -5,7 +5,7 @@ #include #include #include -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; } From 537fda0705678d94023d236ff68e58ae60457f33 Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:13:51 +0530 Subject: [PATCH 6/7] Update numtobase.cpp From 26c4b0043b60f76d99ac216a4e9e2a8f7457fe74 Mon Sep 17 00:00:00 2001 From: jeevansai Date: Sun, 3 Apr 2016 21:14:16 +0530 Subject: [PATCH 7/7] Update sel-sort.cpp --- sel-sort.cpp | 14 ++++++++------ 1 file changed, 8 insertions(+), 6 deletions(-) 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 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; int arr[n]; - getdata(arr, n-1); + getdata(arr, n); sort(arr, n); printdata(arr, n); }