Pure Selection Sort - Hackerrank Problem Solution

Pure Selection Sort

Hackerrank Problem Solution

PROBLEM STATEMENT

You are given an array of integers in any order. Sort the elements of given array in ascending order using selection sort.

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<=n<=600 1<=a[i]<=2*10^6

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

5
1 2 3 4 5

Sample Output 0

1 2 3 4 5
10
4

---

SOLUTION

#include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int swappings=0,comp=0; void swap(int *xp, int *yp) { swappings++; int temp = *xp; *xp = *yp; *yp = temp; } void selectionSort(int arr[], int n) { int i, j, x; for (i = 0; i < n-1; i++) { x = i; for (j = i+1; j < n; j++) { comp++; if (arr[j] < arr[x]) { x = j; } } swap(&arr[x], &arr[i]); } } void printArray(int arr[], int size) { int i; for (i=0; i < size; i++) printf("%d ", arr[i]); printf("\n"); } int main() { int n,arr[100]; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&arr[i]); } selectionSort(arr, n); printArray(arr, n); printf("%d\n",comp); printf("%d",swappings); return 0; /* 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.