Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define MAX_ROWS 100
- #define MAX_COLS 100
- void merge_sort(int arr[], int low, int high){
- if (low < high){
- int mid = low + (high - low) / 2;
- merge_sort(arr, low, mid);
- merge_sort(arr, mid+1, high);
- int i = low, j = mid+1, k = 0;
- int temp[high-low+1];
- while (i <= mid && j <= high){
- if (arr[i] >= arr[j]){
- temp[k++] = arr[i++];
- }
- else {
- temp[k++] = arr[j++];
- }
- }
- while (i <= mid){
- temp[k++] = arr[i++];
- }
- while (j <= high){
- temp[k++] = arr[j++];
- }
- for (i = low, k = 0; i <= high; i++, k++){
- arr[i] = temp[k];
- }
- }
- }
- int* binary_search(int arr[], int low, int high, int key){
- if (low <= high){
- int mid = low + (high - low) / 2;
- if (arr[mid] == key){
- return &arr[mid];
- }
- else if (arr[mid] > key){
- return binary_search(arr, mid + 1, high, key);
- }
- else {
- return binary_search(arr, low, mid - 1, key);
- }
- }
- return NULL;
- }
- int main(){
- int matrix[MAX_ROWS][MAX_COLS];
- int rows, cols, key, count = 0;
- printf("Введіть кількість рядків і стовпців: ");
- scanf("%d %d", &rows, &cols);
- printf("Введіть елементи матриці: ");
- for (int i = 0; i < rows; i++){
- for (int j = 0; j < cols; j++){
- scanf("%d", &matrix[i][j]);
- }
- merge_sort(matrix[i], 0, cols-1);
- }
- printf("Введіть елемент для пошуку: ");
- scanf("%d", &key);
- for (int i = 0; i < rows; i++){
- int* ptr = binary_search(matrix[i], 0, cols-1, key);
- if (ptr != NULL){
- count++;
- }
- }
- if (count > 0){
- printf("Число %d знайдено у %d рядках.\n", key, count);
- }
- else {
- printf("Число %d не знайдено у жодному рядку.\n", key);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment