Advertisement
18126

Day3(ex3)

Jul 8th, 2021
108
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.72 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <math.h>
  4.  
  5. void bSort(int arr[], int n) {
  6.     for (int i = 0; i < n-1; i++) {
  7.         for (int j = 0; j < n-i-1; j++) {
  8.             if (arr[j] > arr[j+1]) {
  9.                 int temp = arr[j];
  10.                 arr[j] = arr[j+1];
  11.                 arr[j+1] = temp;
  12.             }
  13.         }
  14.     }
  15. }
  16.  
  17. void printArray(int arr[], int len) {
  18.     for (int i=0; i < len; i++) {
  19.         printf("%d ", arr[i]);
  20.     }
  21.     printf("\n");
  22. }
  23.  
  24. int main() {
  25.     int arr[] = {2, 5, 3, 7, 9, 1, 6};
  26.     int len = 7;
  27.     printf("Before sorting: \n");
  28.     printArray(arr, len);
  29.     bSort(arr, len);
  30.     printf("After sorting: \n");
  31.     printArray(arr, len);
  32.     return EXIT_SUCCESS;
  33. }
  34.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement