Hello

Author: coder-mayank22

GCD_recur.c

@@ -0,0 +1,20 @@
+#include<stdio.h>
+int gcd(int a, int b){
+    if(a>b){
+        gcd(a-b,b);
+    }
+    else if(a<b){
+        gcd(a,b-a);
+    }
+    else return a;
+}
+int main(){
+    int x,y;
+    printf("Enter 1st number : ");
+    scanf("%d", &x);
+    printf("Enter 2nd number : ");
+    scanf("%d", &y);
+    int GCD = gcd(x,y);
+    printf("\nGCD of %d and %d = %d\n",x,y,GCD);
+    return 0;
+}

GCD_recur.exe

@@ -40,7 +40,7 @@ void Mergesort(int lb,int ub)
 {
 	if(lb<ub)
 	{
-		int mid=(int)(lb+ub)/2;
+		int mid=(lb+ub)/2;
 		Mergesort(lb,mid);
 		Mergesort(mid+1,ub);
 		Merge(lb,mid,ub);

Mergesort.c

@@ -0,0 +1,63 @@
+#include<stdio.h>
+#define MAX 100
+int a[MAX];
+
+void input(int n){
+    printf("Enter values to the array :\n");
+    for(int i=0;i<n;i++){
+        printf("Enter element %d : ", i+1);
+        scanf("%d", &a[i]);
+    }
+}
+
+void sort(int n){
+    int i, j, t, flag;
+    for(i=0;i<n-1;i++){
+        flag=0;
+        for(j=0;j<n-1-i;j++){
+            if(a[j]>a[j+1]){
+                flag=1;
+                t=a[j];
+                a[j]=a[j+1];
+                a[j+1]=t;
+            }
+        }
+        if(flag==0) break;
+    }
+    printf("\nSorted array : ");
+    for(i=0;i<n;i++){
+        printf("%d ", a[i]);
+    }
+    printf("\n");
+}
+
+int b_search(int ele, int n){
+    int lb=0, ub=n-1, mid;
+    while(lb<=ub){
+        mid = (lb+ub)/2;
+        if(a[mid]==ele){
+            return mid;
+        }
+        else if(a[mid]>ele) lb=mid+1;
+        else ub=mid-1;
+    }
+    return -1;
+}
+
+int main(){
+    int n, ele;
+    printf("Enter size of the array : ");
+    scanf("%d", &n);
+    input(n);
+    sort(n);
+    printf("Enter element to be searched for : ");
+    scanf("%d", &ele);
+    int pos = b_search(ele,n);
+    if(pos==-1){
+        printf("%d is not present.\n", ele);
+    }
+    else{
+        printf("%d is present at position %d.\n", ele, pos);
+    }
+    return 0;
+}

Mergesort.exe

@@ -0,0 +1,75 @@
+#include<stdio.h>
+#define MAX 100
+
+int a[MAX], n;
+
+void insert(int pos, int item){
+    n+=1;
+    if(pos==1){
+        for(int i=n;i>0;i--)
+        a[i] = a[i-1];
+        a[pos-1] = item;
+    }
+    else if(pos==n){
+        a[pos-1] = item;
+    }
+    else{
+        for(int i=n;i>=pos;i--) a[i] = a[i-1];
+        a[pos-1] = item;
+    }
+}
+
+void delete(int pos){
+    if(pos==1){
+        for(int i=0;i<n-1;i++) a[i] = a[i+1];
+    }
+    else{
+        for(int i=pos-1;i<n-1;i++) a[i] = a[i+1];
+    }
+    n-=1;
+}
+
+void display(){
+    printf("Current Array : ");
+    for(int i=0;i<n;i++) printf("%d ", a[i]);
+    printf("\n");
+}
+
+int main(){
+    printf("Enter size of the array : ");
+    scanf("%d", &n);
+    printf("Enter %d values to the array\n", n);
+    for(int i=0;i<n;i++)scanf("%d", &a[i]);
+    display();
+
+    int ins, pos, ch, conti=1;
+    do{
+        printf("\n\nPress 1 to insert an element.\n");
+        printf("Press 2 to delete an element.\n");
+        printf("Press 3 to display the current array.\n");
+        printf("Press 4 to exit.\n");
+        printf("\nEnter choice : ");
+        scanf("%d", &ch);
+        switch(ch){
+            case 1:
+                printf("Enter item to be inserted : ");
+                scanf("%d", &ins);
+                printf("Enter position where it is to be inserted : ");
+                scanf("%d", &pos);
+                insert(pos, ins);
+                break;
+            case 2:
+                printf("Enter position from where item is to be deleted : ");
+                scanf("%d", &pos);
+                delete(pos);
+                break;
+            case 3:
+                display();
+                break;
+            case 4:
+                conti = 0;
+                break;
+            default: printf("WRONG CHOICE\n");
+        }
+    }while(conti==1);
+}

bin_search.c

@@ -0,0 +1,37 @@
+#include<stdio.h>
+#define MAX 100
+
+int a[MAX];
+void sort(int n){
+    int i, t, c;
+    for(i=1;i<n;i++){
+        t=a[i];
+        c=i-1;
+        while(c>=0 && t<a[c]){
+            a[c+1] = a[c];
+            c--;
+        }
+        a[c+1] = t;
+    }
+}
+
+int main(){
+    int i, n;
+    printf("Enter number of elements : ");
+    scanf("%d", &n);
+    for(i=0;i<n;i++){
+        printf("Enter element %d : ", i+1);
+        scanf("%d", &a[i]);
+    }
+    printf("\nArray before sorting : ");
+    for(i=0;i<n;i++){
+        printf("%d ", a[i]);
+    }
+
+    printf("\n\nArray after sorting : ");
+    sort(n);
+    for(i=0;i<n;i++){
+        printf("%d ", a[i]);
+    }
+    return 0;
+}