Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void exchange_sort(int *x, int n)
- {
- int i, j, min, index, temp;
- for (i = 0; i < n; i++)
- {
- int gavno = x[i];
- min = x[i];
- index = i;
- for (j = i;j < n; j++)
- if (x[j] % 10 < min % 10)
- {
- min = x[j];
- index = j;
- }
- x[i] = x[index];
- x[index] = gavno;
- }
- }
- int search(int *arr, int size, int search_number)
- {
- int rr, number;
- rr = arr[0];
- for (int i = 0; i < size; i++)
- if (abs(arr[i] - search_number) < rr)
- {
- rr = abs(arr[i] - search_number);
- number = arr[i];
- }
- return number;
- }
- int main()
- {
- int n, search_number;
- printf("Enter array size = ");
- scanf("%d", &n);
- printf("Enter number for search = ");
- scanf("%d", &search_number);
- int a[n];
- for (int i = 0; i < n; i++)
- {
- printf("a[%d] = ", i);
- scanf("%d", &a[i]);
- }
- exchange_sort(a, n);
- for (int i = 0; i < n; i++)
- printf("%d ", a[i]);
- printf("found number: %d", search(a, n, search_number));
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement