#int array

New Post has been published on http://ictjobs.info/program-implement-postman-sort-algorithm/

C Program to Implement Postman Sort Algorithm

#include <stdio.h> void arrange(int,int); int array[100], array1[100]; int i, j, temp, max, count, maxdigits = 0, c = 0; void main() int t1, t2, k, t, n = 1; printf("Enter size of array :"); scanf("%d", &count); printf("Enter elements into array :"); for (i = 0; i < count; i++) scanf("%d", &array[i]); array1[i] = array[i]; for (i = 0; i < count; i++) t = array[i]; /*first element in t */ while(t > 0) c++; t = t / 10; /* Find MSB */ if (maxdigits < c) maxdigits = c; /* number of digits of a each number */ c = 0; while(--maxdigits) n = n * 10; for (i = 0; i < count; i++) max = array[i] / n; /* MSB - Dividnng by perticular base */ t = i; for (j = i + 1; j < count;j++) if (max > (array[j] / n)) max = array[j] / n; /* greatest MSB */ t = j; temp = array1[t]; array1[t] = array1[i]; array1[i] = temp; temp = array[t]; array[t] = array[i]; array[i] = temp; while (n >= 1) for (i = 0; i < count;) t1 = array[i] / n; for (j = i + 1; t1 == (array[j] / n); j++); arrange(i, j); i = j; n = n / 10; printf("\nSorted Array (Postman sort) :"); for (i = 0; i < count; i++) printf("%d ", array1[i]); printf("\n"); /* Function to arrange the of sequence having same base */ void arrange(int k,int n) for (i = k; i < n - 1; i++) for (j = i + 1; j < n; j++) if (array1[i] > array1[j]) temp = array1[i]; array1[i] = array1[j]; array1[j] = temp; temp = (array[i] % 10); array[i] = (array[j] % 10); array[j] = temp;

Output

New Post has been published on http://ictjobs.info/program-implement-selection-sort-method-functions/

C Program to Implement Selection Sort Method using Functions

#include <stdio.h> int findmax(int b[10], int k); void exchang(int b[10], int k); void main() int array[10]; int i, j, n, temp; printf("Enter the value of n \n"); scanf("%d", &n); printf("Enter the elements one by one \n"); for (i = 0; i < n; i++) scanf("%d", &array[i]); printf("Input array elements \n"); for (i = 0; i < n ; i++) printf("%d\n", array[i]); /* Selection sorting begins */ exchang(array, n); printf("Sorted array is...\n"); for (i = 0; i < n; i++) printf("%d\n", array[i]); /* function to find the maximum value */ int findmax(int b[10], int k) int max = 0, j; for (j = 1; j <= k; j++) if (b[j] > b[max]) max = j; return(max); void exchang(int b[10], int k) int temp, big, j; for (j = k - 1; j >= 1; j--) big = findmax(b, j); temp = b[big]; b[big] = b[j]; b[j] = temp; return;

Output

New Post has been published on http://ictjobs.info/program-read-array-search-element/

C Program to Read an Array and Search for an Element

#include <stdio.h> void main() int array[20]; int i, low, mid, high, key, size; printf("Enter the size of an array\n"); scanf("%d", &size); printf("Enter the array elements\n"); for (i = 0; i < size; i++) scanf("%d", &array[i]); printf("Enter the key\n"); scanf("%d", &key); /* search begins */ low = 0; high = (size - 1); while (low <= high) mid = (low + high) / 2; if (key == array[mid]) printf("SUCCESSFUL SEARCH\n"); return; if (key < array[mid]) high = mid - 1; else low = mid + 1; printf("UNSUCCESSFUL SEARCH\n");

Output

New Post has been published on http://ictjobs.info/program-accept-sorted-array-search-binary-search/

C Program to accept Sorted Array and do Search using Binary Search

#include <stdio.h> void main() int array[10]; int i, j, num, temp, keynum; int low, mid, high; printf("Enter the value of num \n"); scanf("%d", &num); printf("Enter the elements one by one \n"); for (i = 0; i < num; i++) scanf("%d", &array[i]); printf("Input array elements \n"); for (i = 0; i < num; i++) printf("%d\n", array[i]); /* Bubble sorting begins */ for (i = 0; i < num; i++) for (j = 0; j < (num - i - 1); j++) if (array[j] > array[j + 1]) temp = array[j]; array[j] = array[j + 1]; array[j + 1] = temp; printf("Sorted array is...\n"); for (i = 0; i < num; i++) printf("%d\n", array[i]); printf("Enter the element to be searched \n"); scanf("%d", &keynum); /* Binary searching begins */ low = 1; high = num; do mid = (low + high) / 2; if (keynum < array[mid]) high = mid - 1; else if (keynum > array[mid]) low = mid + 1; while (keynum != array[mid] && low <= high); if (keynum == array[mid]) printf("SEARCH SUCCESSFUL \n"); else printf("SEARCH FAILED \n");

Output

New Post has been published on http://ictjobs.info/program-sort-numbers-ascending-order-bubble-sort/

C Program to Sort N Numbers in Ascending Order using Bubble Sort

#include <stdio.h> #define MAXSIZE 10 void main() int array[MAXSIZE]; int i, j, num, temp; printf("Enter the value of num \n"); scanf("%d", &num); printf("Enter the elements one by one \n"); for (i = 0; i < num; i++) scanf("%d", &array[i]); printf("Input array is \n"); for (i = 0; i < num; i++) printf("%d\n", array[i]); /* Bubble sorting begins */ for (i = 0; i < num; i++) for (j = 0; j < (num - i - 1); j++) if (array[j] > array[j + 1]) temp = array[j]; array[j] = array[j + 1]; array[j + 1] = temp; printf("Sorted array is...\n"); for (i = 0; i < num; i++) printf("%d\n", array[i]);

Output

New Post has been published on http://ictjobs.info/program-find-number-repeated-elements-array/

C Program to Find the Number of Non Repeated Elements in an Array

#include <stdio.h> int main() int array[50]; int *ptr; int i, j, k, size, n; printf("\n Enter size of the array: "); scanf("%d", &n); printf("\n Enter %d elements of an array: ", n); for (i = 0; i < n; i++) scanf("%d", &array[i]); size = n; ptr = array; for (i = 0; i < size; i++) for (j = 0; j < size; j++) if (i == j) continue; else if (*(ptr + i) == *(ptr + j)) k = j; size--; while (k < size) *(ptr + k) = *(ptr + k + 1); k++; j = 0; printf("\n The array after removing duplicates is: "); for (i = 0; i < size; i++) printf(" %d", array[i]); return 0;

Output

New Post has been published on http://ictjobs.info/program-find-odd-element-array-element/

C Program to Find the Odd Element given an Array with only two Different Element

#include <stdio.h> void printodd(int array[], int size) int xor2 = array[0]; /* Will hold XOR of two odd occurring elements */ int set; int i; int n = size - 2; int x = 0, y = 0; /* The xor will basically be xor of two odd occurring elements */ for (i = 1; i < size; i++) xor2 = xor2 ^ array[i]; /* Get one set rightmost bit in the xor2. */ set = xor2 & ~(xor2 - 1); /* Now divide elements in two sets: */ for (i = 0; i < size; i++) /* XOR of first set is finally going to hold one odd occurring number x */ if (array[i] & set) x = x ^ array[i]; /* XOR of second set is finally going to hold the other odd occurring number y */ else y = y ^ array[i]; printf("\n The ODD elements are %d & %d ", x, y); int main() int array[] = 10, 3, 2, 10, 2, 8, 8, 7; int arr_size = sizeof(array) / sizeof(array[0]); printodd(array, arr_size); getchar(); return 0;

Output

New Post has been published on http://ictjobs.info/program-find-largest-number-array/

C Program to Find the Largest Number in an Array

#include <stdio.h> int main() int array[50], size, i, largest; printf("\n Enter the size of the array: "); scanf("%d", &size); printf("\n Enter %d elements of the array: ", size); for (i = 0; i < size; i++) scanf("%d", &array[i]); largest = array[0]; for (i = 1; i < size; i++) if (largest < array[i]) largest = array[i]; printf("\n largest element present in the given array is : %d", largest); return 0;

Output