Pure Bubble Sort - Hackerrank Problem Solution

Pure Bubble Sort

Hackerrank Problem Solution

PROBLEM STATEMENT

Input Format

The first line contains an integer, n , the size of the array

The second line contains n space-separated integers a[i].

Constraints

2

Output Format

You must print the following three lines of output:

1. Array is sorted and printed in ascending order
2. Total number of comparisons
3. Total number of swaps.

Sample Input 0

3
1 2 3

Sample Output 0

1 2 3
2
0

---

SOLUTION

#include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int arr[601],arr2[601],flag=1; int main() { int n, swaps = 0,comp=0; scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &arr[i]); } for (int i = 0; i < n; i++) { arr2[i]=arr[i]; } for (int i = 0 ; i < n; i++) { for (int j = 0; j < n-1; j++) { if (arr[j] > arr[j+1]) { int t = arr[j]; arr[j] = arr[j+1]; arr[j+1] = t; swaps++; } } } for(int i=0;i<n;i++){ printf("%d ",arr[i]); if(arr[i]!=arr2[i]){ flag=0; } } if(flag==1){ comp=n-1; } else{ comp=(n*(n-1))/2; } printf("\n%d", comp); printf("\n%d", swaps); /* Enter your code here. Read input from STDIN. Print output to STDOUT */ return 0; }

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.