HR30 Day 20: Sorting 문서 원본 보기

==개요==
HR30 Day 20: Sorting
* https://www.hackerrank.com/challenges/30-sorting/problem

{{HR30 헤더}}
{{HR30 20-29}}
|}

==Java==
<syntaxhighlight lang='Java'>
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        // Write Your Code Here
        int numberOfSwaps = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n - 1; j++) {
                if (a[j] > a[j + 1]) {
                    int temp = a[j];
                    a[j] = a[j+1];
                    a[j+1] = temp;
                    numberOfSwaps++;
                }
            }
            if (numberOfSwaps == 0) break;
        }
        System.out.printf( "Array is sorted in %d swaps.\n", numberOfSwaps );
        System.out.printf( "First Element: %d\n", a[0] );
        System.out.printf( "Last Element: %d\n", a[n-1] );
    }
}
</syntaxhighlight>

==PHP==
<syntaxhighlight lang='PHP'>
<?php
$handle = fopen ("php://stdin", "r");
fscanf($handle, "%d",$n);
$a_temp = fgets($handle);
$a = explode(" ",$a_temp);
$a = array_map('intval', $a);
// Write Your Code Here
$numberOfSwaps = 0;
for($i=0; $i<$n; $i++) {
    for($j=0; $j<$n-1; $j++) {
        if ($a[$j] > $a[$j+1]) {
            $temp = $a[$j];
            $a[$j] = $a[$j+1];
            $a[$j+1] = $temp;
            $numberOfSwaps++;
        }
    }
    if ($numberOfSwaps == 0) break;
}
echo "Array is sorted in ".$numberOfSwaps." swaps.\n";
echo "First Element: ".$a[0]."\n";
echo "Last Element: ".$a[$n-1]."\n";
</syntaxhighlight>