1. n 2. For j 3. smallest 4. For i 5. if A[i] 6. then smallest 7. exchange(A[j],A[smallest])
1. For i 2. For j 3. if A[j] 4. exchange(A[j],A[j-1])
#include #include int main() { char ch; int arr[40],n,i,item; printf("\nHow many elements you want to enter in the array: "); scanf("%d",&n); for(i=0;i …
#include #include #define MAXSIZE 70 int main() { int x[MAXSIZE],n,i,j,tmp; printf("Enter the nu…
/* program for Array Implementation of Stack*/ #include #include #include #define MAX 5 typedef struct stack { int data[MAX]; int top; }stack; void init(stack *); int empty(stack *); int …
Social Plugin