From ef5e5021e8cdf7af1615875aad1e6ca5ac9df1af Mon Sep 17 00:00:00 2001 From: j-tesla Date: Mon, 9 Dec 2019 07:03:32 +0530 Subject: [PATCH 1/8] adding swap.cpp --- swap.cpp | 9 +++++++++ 1 file changed, 9 insertions(+) create mode 100644 swap.cpp diff --git a/swap.cpp b/swap.cpp new file mode 100644 index 0000000..1c3ac61 --- /dev/null +++ b/swap.cpp @@ -0,0 +1,9 @@ +#include + +int swap(int *a, int *b) +{ + + *a = *a + *b; + *b = *a - *b; + *a = *a - *b; +} \ No newline at end of file From 0bdaaa15903aed86d6e239060955a784058d4892 Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Mon, 9 Dec 2019 01:45:30 +0530 Subject: [PATCH 2/8] update swap.cpp --- swap.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/swap.cpp b/swap.cpp index 1c3ac61..46735e4 100644 --- a/swap.cpp +++ b/swap.cpp @@ -1,9 +1,9 @@ #include -int swap(int *a, int *b) +void swap(int *a, int *b) { *a = *a + *b; *b = *a - *b; *a = *a - *b; -} \ No newline at end of file +} From a26186a9510d336a0768472415b837c871567530 Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Mon, 9 Dec 2019 03:12:09 +0530 Subject: [PATCH 3/8] create bubblesort --- Sorting Algos/bubblesort | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Sorting Algos/bubblesort diff --git a/Sorting Algos/bubblesort b/Sorting Algos/bubblesort new file mode 100644 index 0000000..432cf02 --- /dev/null +++ b/Sorting Algos/bubblesort @@ -0,0 +1,18 @@ +void bubblesort(int mylist[]) +{ + int k=1; + while (k==1) + { + k=0; + for (i=1;i<=n;i++) + { + if (mylist[i]>=mylist[i-1]) + { + temp=mylist[i]; + mylist[i]=mylist[i-1]; + mylist[i-1]=temp; + k=1; + } + } + } +} From 3f3a50732cad6bfeb0696acd396465046152c813 Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Mon, 9 Dec 2019 03:13:16 +0530 Subject: [PATCH 4/8] Rename bubblesort to bubblesort.cpp --- Sorting Algos/{bubblesort => bubblesort.cpp} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Sorting Algos/{bubblesort => bubblesort.cpp} (100%) diff --git a/Sorting Algos/bubblesort b/Sorting Algos/bubblesort.cpp similarity index 100% rename from Sorting Algos/bubblesort rename to Sorting Algos/bubblesort.cpp From fcab0360171b917a80d3c57cfc3c06d768d4bf5f Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Wed, 11 Dec 2019 20:56:23 +0530 Subject: [PATCH 5/8] Update bubblesort.cpp --- Sorting Algos/bubblesort.cpp | 41 ++++++++++++++++++++++-------------- 1 file changed, 25 insertions(+), 16 deletions(-) diff --git a/Sorting Algos/bubblesort.cpp b/Sorting Algos/bubblesort.cpp index 432cf02..6e1833c 100644 --- a/Sorting Algos/bubblesort.cpp +++ b/Sorting Algos/bubblesort.cpp @@ -1,18 +1,27 @@ -void bubblesort(int mylist[]) +void swap(int *a , int *b) { - int k=1; - while (k==1) - { - k=0; - for (i=1;i<=n;i++) - { - if (mylist[i]>=mylist[i-1]) - { - temp=mylist[i]; - mylist[i]=mylist[i-1]; - mylist[i-1]=temp; - k=1; - } - } - } + *a = *a + *b; + *b = *a - *b; + *a = *a - *b; +} + +void bub_sort(int a[], int size) +{ + + for(int i =size-1; i > 0; i--) + { + int flag = 0; + + for(int j = 0; j < i; j++) + { + if(a[j] > a[j+1]) + { + swap(a+j, a+j+1); + + flag = 1; + } + + } + if(flag == 0) break; + } } From e98a75e4c8d5774a2bf4863174e16f4a2450b741 Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Wed, 11 Dec 2019 20:59:01 +0530 Subject: [PATCH 6/8] Create select_sort.cpp --- Sorting Algos/select_sort.cpp | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 Sorting Algos/select_sort.cpp diff --git a/Sorting Algos/select_sort.cpp b/Sorting Algos/select_sort.cpp new file mode 100644 index 0000000..3d1bcd7 --- /dev/null +++ b/Sorting Algos/select_sort.cpp @@ -0,0 +1,33 @@ +int minloc(int A[], int k, int size) +{ + int min = k; + + for(int i = k; i < size; i++) + { + if(A[i] < A[min]) + { + min = i; + } + } + return min; +} + +void swap(int *a, int *b) +{ + int t; + t=*a; + *a=*b; + *b=t; + +} + + +void selec_sort(int A[], int size) +{ + for(int i = 0; i < size; i++) + { + int temp = minloc(A,i,size); + swap(&A[temp],A+i); + + } +} From 03d9315c32489613afafa1419e6718cb7664d935 Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Wed, 11 Dec 2019 21:01:12 +0530 Subject: [PATCH 7/8] Create insert_sort.cpp for c or c++ --- Sorting Algos/insert_sort.cpp | 19 +++++++++++++++++++ 1 file changed, 19 insertions(+) create mode 100644 Sorting Algos/insert_sort.cpp diff --git a/Sorting Algos/insert_sort.cpp b/Sorting Algos/insert_sort.cpp new file mode 100644 index 0000000..ece5873 --- /dev/null +++ b/Sorting Algos/insert_sort.cpp @@ -0,0 +1,19 @@ +void insert_sort(int a[], int size) +{ + int i, j, item; + + for(i = 1; i < size; i++) + { + item = a[i]; + + j = i-1; + + while((item < a[j]) && (j >= 0)) + { + a[j+1] = a[j]; + j--; + } + + a[j+1] = item; + } +} From 416e3ba9bd592fb171b1d07313e346d19da7ab4d Mon Sep 17 00:00:00 2001 From: j-tesla <58279279+j-tesla@users.noreply.github.com> Date: Wed, 11 Dec 2019 21:14:02 +0530 Subject: [PATCH 8/8] Create stacks.c stack functions like push, pop,is empty,isfull --- stacks.c | 70 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 70 insertions(+) create mode 100644 stacks.c diff --git a/stacks.c b/stacks.c new file mode 100644 index 0000000..22af687 --- /dev/null +++ b/stacks.c @@ -0,0 +1,70 @@ +#include +//stack array + + +#include + +#define MAX 100 + +struct lifo { + + int st[MAX] + + int top; +}; + +typedef struct lifo stack; + + +void create (stack* s){ + + (*s).top = -1; + +} + +void push (stack* s, int element) { + + if((*s).top == (MAX-1)){ + + printf("\nStack Overflow"); + exit(-1); + + } + + else { + + (*s).top++; + + s->((*s).top) = element; //trail + } +} + +int pop (stack *s) { + + if ((*s).top == -1){ + + printf ("\nStack underflow"); + + exit(-1); + } + + else { + + return ((*s).st[(*s).top--]); + } +} + +int ifempty(stack s) { + + if (s.to == -1) return 1; + + else return 0; + +} + +int isfull (stack s) { + + if(s.top == (MAX-1)) return 1; + + else return 0; +}