Sort first k values in ascending order and remaining n-k values in descending order - Coding

Given an array of size n, arrange the first k elements of the array in ascending order and the remaining n-k elements in descending order.

Examples:

Input: arr[] = {5, 4, 6, 2, 1, 3, 8, 9, -1}, k = 4
Output: 2 4 5 6 9 8 3 1 -1

Input: arr[] = {5, 4, 6}, k = 2
Output: 4 5 6

Algorithm:

Store the first k elements in an array and sort that in ascending order.
Store the remaining n-k elements in an array and sort that in descending order.
Merge the two arrays by adding the elements from the second array in reverse order.

C++

<?php
// PHP program to sort first 
// k elements in increasing order 
// and remaining n-k elements in 
// decreasing
 
// Function to sort the array
function printOrder($arr, $n, $k)
{
    $len1 = $k;
    $len2 = $n - $k;
    $arr1 = array_fill(0, $k, 0);
    $arr2 = array_fill(0, ($n - $k), 0);
 
    // Store the k elements 
    // in an array
    for ($i = 0; $i < $k; $i++)
        $arr1[$i] = $arr[$i];
 
    // Store the remaining n-k 
    // elements in an array
    for ($i = $k; $i < $n; $i++)
        $arr2[$i - $k] = $arr[$i];
 
    // sorting the array from
    // 0 to k-1 places
    sort($arr1);
 
    // sorting the array from
    // k to n places
    sort($arr2);
 
    // storing the values in the 
    // final array arr
    for ($i = 0; $i < $n; $i++)
        if ($i < $k)
            $arr[$i] = $arr1[$i];
 
        else
        {
            $arr[$i] = $arr2[$len2 - 1];
            $len2 -= 1;
    }
     
    // printing the array
    for ($i = 0; $i < $n; $i++)
        print($arr[$i] . " ");
}
 
// Driver code
$arr = array( 5, 4, 6, 2, 1, 3, 8, 9, -1 );
$k = 4;
 
$n = count($arr);
 
printOrder($arr, $n, $k);
 
// This code is contributed by mits
?>

Javascript

<?php
// PHP program to sort first k elements
// in increasing order and remaining
// n-k elements in decreasing
 
// function to sort the array
function printOrder($arr, $n, $k)
{
    // Sort first k elements in ascending order
    $a= array_slice($arr, 0, $k);
    sort($a);
 
    // Sort remaining n-k elements in descending order
    $b = array_slice($arr, $k, $n);
    sort($b);
    $b = array_reverse($b);
    unset($arr);
    $arr = $a;
    return array_merge($arr, $b);
}
 
    // Driver code
    $arr = array( 5, 4, 6, 2, 1, 3, 8, 9, -1 );
    $k = 4;
    $n = count($arr);
 
    $arr=printOrder($arr, $n, $k);
 
    for ($i = 0; $i < $n; $i++)
        echo $arr[$i]." ";
 
// This code is contributed by mits
?>

Javascript

<script>
 
// Javascript program to sort first k elements
// in increasing order and remaining
// n-k elements in decreasing
function printOrder(arr, k)
{
    let n = arr.length;
 
    // Sort first k elements in ascending order
    // Sort remaining n-k elements in descending order
    arr = arr.slice(0, k).sort(
        function(a, b){return a - b;}).concat(
        arr.slice(k, n).sort(function(a, b){return b - a;}));
     
    return arr;
}
 
// Driver code
 
// Our arr contains 8 elements
let arr = [ 5, 4, 6, 2, 1, 3, 8, 9, -1 ];
let k = 4;
arr = printOrder(arr, k);
 
document.write(arr.join(" "));
 
// This code is contributed by avanitrachhadiya2155
 
</script>

Output:

2 4 5 6 9 8 3 1 -1

Time Complexity: O(N * log(N))
Auxiliary Space: O(1)

Reffered: https://www.geeksforgeeks.org

C++

Related
Passing Reference to a Pointer in C++
wcscspn() function in C/C++
iswupper() function in C/C++
wcscoll() function in C++
wcschr() function in C++

Type:	Geek
Category:	Coding
Sub Category:	Tutorial
Uploaded by:	Admin
Views:	7