Day 20: Sorting

PHOTO EMBED

Sat May 07 2022 23:49:15 GMT+0000 (Coordinated Universal Time)

Saved by @GreenMark #javascript 

'use strict';

process.stdin.resume();
process.stdin.setEncoding('utf-8');

let inputString = '';
let currentLine = 0;

process.stdin.on('data', function(inputStdin) {
    inputString += inputStdin;
});

process.stdin.on('end', function() {
    inputString = inputString.split('\n');

    main();
});

function readLine() {
    return inputString[currentLine++];
}


function main() {
    const n = parseInt(readLine().trim(), 10);

    const a = readLine().replace(/\s+$/g, '').split(' ').map(aTemp => parseInt(aTemp, 10));

    var numberOfSwaps = 0;
    for (var i = 0; i < n; i++) {
    
    var item;
    for (var j = 0; j < n - 1; j++) {
    
        if (a[j] > a[j + 1]) {
            item = a[j];
            a[j]= a[j + 1];
            a[j + 1] = item;
            numberOfSwaps++;
        }
    }
   
   
    if (numberOfSwaps == 0) {
        break;
    }
   
}
    
   console.log("Array is sorted in", numberOfSwaps,"swaps.");
   console.log("First Element:", a[0]);
   console.log("Last Element:", a[a.length-1]);
    
}
content_copyCOPY

Objective Today, we're discussing a simple sorting algorithm called Bubble Sort. Check out the Tutorial tab for learning materials and an instructional video! Consider the following version of Bubble Sort: for (int i = 0; i < n; i++) { // Track number of elements swapped during a single array traversal int numberOfSwaps = 0; for (int j = 0; j < n - 1; j++) { // Swap adjacent elements if they are in decreasing order if (a[j] > a[j + 1]) { swap(a[j], a[j + 1]); numberOfSwaps++; } } // If no elements were swapped during a traversal, array is sorted if (numberOfSwaps == 0) { break; } } Task Given an array, , of size distinct elements, sort the array in ascending order using the Bubble Sort algorithm above. Once sorted, print the following lines: Array is sorted in numSwaps swaps. where is the number of swaps that took place. First Element: firstElement where is the first element in the sorted array. Last Element: lastElement where is the last element in the sorted array. Hint: To complete this challenge, you will need to add a variable that keeps a running tally of all swaps that occur during execution. Example original a: 4 3 1 2 round 1 a: 3 1 2 4 swaps this round: 3 round 2 a: 1 2 3 4 swaps this round: 2 round 3 a: 1 2 3 4 swaps this round: 0 In the first round, the is swapped at each of the comparisons, ending in the last position. In the second round, the is swapped at of the comparisons. Finally, in the third round, no swaps are made so the iterations stop. The output is the following: Array is sorted in 5 swaps. First Element: 1 Last Element: 4 Input Format The first line contains an integer, , the number of elements in array . The second line contains space-separated integers that describe . Constraints , where . Output Format Print the following three lines of output: Array is sorted in numSwaps swaps. where is the number of swaps that took place. First Element: firstElement where is the first element in the sorted array. Last Element: lastElement where is the last element in the sorted array. Sample Input 0 3 1 2 3 Sample Output 0 Array is sorted in 0 swaps. First Element: 1 Last Element: 3 Explanation 0 The array is already sorted, so swaps take place and we print the necessary lines of output shown above. Sample Input 1 3 3 2 1 Sample Output 1 Array is sorted in 3 swaps. First Element: 1 Last Element: 3 Explanation 1 The array is not sorted, so we perform the following swaps. Each line shows after each single element is swapped. After swaps, the array is sorted.