#include #include #include int arr[21]; int max(int n) { int max_value, max_index = 0, i; max_value = arr[max_index]; for (i = 0; i <= n; i++) if (arr[i] > max_value) { max_value = arr[i]; max_index = i; } return max_index; } void sort(int n) { int largest, temp; if (n <= 1) return; largest = max(n - 1); temp = arr[largest]; arr[largest] = arr[n - 1]; arr[n - 1] = temp; sort(n - 1); } float powe(float x, int a, int n) { if(a == 0) return 1; if(n == a) return x; else return x * powe(x,a,n+1); } int palin(char str[],int n) { if(n= 20) { printf("EXCEEDED ARRAY SIZE of 20\n"); break; } else { arr[index] = temp; index++; } } while (temp != -1); printf("Enter the number to be searched: "); scanf("%d",&a); sort(index-1); a = bin(a,0,index-1); if(a==-1) printf("Number not found\n"); else printf("Number found\n"); } else if(ch == 6) { exit(0); } else { printf("Invalid choice, choose again\n"); } } }