fork download
  1. #include <stdio.h>
  2.  
  3. int main() {
  4. int arr[] = {64, 25, 12, 22, 11};
  5. int n = sizeof(arr) / sizeof(arr[0]);
  6.  
  7. printf("Original array: ");
  8. for (int i = 0; i < n; i++) {
  9. printf("%d ", arr[i]);
  10. }
  11. printf("\n");
  12.  
  13. // Bubble sort
  14. for (int i = 0; i < n - 1; i++) {
  15. for (int j = 0; j < n - i - 1; j++) {
  16. if (arr[j] > arr[j + 1]) {
  17. // Swap if the element at j is greater than the element at j+1
  18. int temp = arr[j];
  19. arr[j] = arr[j + 1];
  20. arr[j + 1] = temp;
  21. }
  22. }
  23. }
  24.  
  25. printf("Sorted array: ");
  26. for (int i = 0; i < n; i++) {
  27. printf("%d ", arr[i]);
  28. }
  29. printf("\n");
  30.  
  31. return 0;
  32. }
  33.  
Success #stdin #stdout 0s 5308KB
stdin
Standard input is empty
stdout
Original array: 64 25 12 22 11 
Sorted array: 11 12 22 25 64