按顺序重新排列阵列-最小，最大，第二个最小，第二个最大..

给定一个整数数组，任务是按顺序打印该数组-最小数，最大数，第二最小数，第二最大数，第三最小数，第三最大数，依此类推。
例子：

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

Input : arr[] = [1, 2, 3, 4]
Output :arr[] = {1, 4, 2, 3}

一个简单的解决方案是先找到最小的元素，然后将其与第一个元素交换。然后找到最大的元素，将其与第二个元素交换，依此类推。该解决方案的时间复杂度为O(n ² )。
一个有效的解决方案是使用排序。
1.对数组的元素进行排序。
2.取两个变量i和j并将它们分别指向数组的第一个索引和最后一个索引。
3.现在运行一个循环，并通过递增i和递减j来将元素逐一存储在数组中。
让我们以输入为5、8、1、4、2、9、3、7、6的数组进行排序，使该数组成为1、2、3、4、5、6、7、8、9。现在取两个变量分别说i和j并将它们分别指向数组的第一个索引和最后一个索引，运行循环并通过递增i和递减j将值存储到新数组中。我们得到的最终结果是1 9 2 8 3 7 4 6 5。

C++

// C++ program to print the array in given order
#include 
using namespace std;
 
// Function which arrange the array.
void rearrangeArray(int arr[], int n)
{  
    // Sorting the array elements
    sort(arr, arr + n);
 
    int tempArr[n];  // To store modified array
 
    // Adding numbers from sorted array to
    // new array accordingly
    int ArrIndex = 0;
 
    // Traverse from begin and end simultaneously
    for (int i = 0, j = n-1; i <= n / 2 ||
                    j > n / 2; i++, j--) {
        tempArr[ArrIndex] = arr[i];
        ArrIndex++;
        tempArr[ArrIndex] = arr[j];
        ArrIndex++;
    }
 
    // Modifying original array
    for (int i = 0; i < n; i++)
        arr[i] = tempArr[i];
}
 
// Driver Code
int main()
{
    int arr[] = { 5, 8, 1, 4, 2, 9, 3, 7, 6 };
    int n = sizeof(arr) / sizeof(arr[0]);
    rearrangeArray(arr, n);
 
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
 
    return 0;
}

Java

// Java program to print the array in given order
import java.util.Arrays;
 
public class GFG {
 
    // Function which arrange the array.
    static void rearrangeArray(int arr[], int n)
    {  
        // Sorting the array elements
        Arrays.sort(arr);
      
        int[] tempArr = new int[n]; // To store modified array
         
        // Adding numbers from sorted array to
        // new array accordingly
        int ArrIndex = 0;
      
        // Traverse from begin and end simultaneously
        for (int i = 0, j = n-1; i <= n / 2 || j > n / 2;
                                           i++, j--) {
            if(ArrIndex < n)
            {
                tempArr[ArrIndex] = arr[i];
                ArrIndex++;
            }
             
            if(ArrIndex < n)
            {
                tempArr[ArrIndex] = arr[j];
                ArrIndex++;
            }
        }
      
        // Modifying original array
        for (int i = 0; i < n; i++)
            arr[i] = tempArr[i];
    }
      
    // Driver Code
    public static void main(String args[])
    {
        int arr[] = { 5, 8, 1, 4, 2, 9, 3, 7, 6 };
        int n = arr.length;
        rearrangeArray(arr, n);
      
        for (int i = 0; i < n; i++)
            System.out.print(arr[i]+" ");
    }
}
// This code is contributed by Sumit Ghosh

Python3

# Python 3 program to print
# the array in given order
 
# Function which arrange the
# array.
def rearrangeArray(arr, n) :
 
    # Sorting the array elements
    arr.sort()
 
    # To store modified array
    tempArr = [0] * (n + 1)
 
    # Adding numbers from sorted
    # array to new array accordingly
    ArrIndex = 0
 
    # Traverse from begin and end
    # simultaneously
    i = 0
    j = n-1
     
    while(i <= n // 2 or j > n // 2 ) :
     
        tempArr[ArrIndex] = arr[i]
        ArrIndex = ArrIndex + 1
        tempArr[ArrIndex] = arr[j]
        ArrIndex = ArrIndex + 1
        i = i + 1
        j = j - 1
     
    # Modifying original array
    for i in range(0, n) :
        arr[i] = tempArr[i]
         
 
# Driver Code
arr = [ 5, 8, 1, 4, 2, 9, 3, 7, 6 ]
n = len(arr)
rearrangeArray(arr, n)
 
for i in range(0, n) :
    print( arr[i], end = " ")
     
# This code is contributed by Nikita Tiwari.

C#

// C# program to print the
// array in given order
using System;
 
public class GFG {
 
    // Function which arrange the array.
    static void rearrangeArray(int []arr, int n)
    {
        // Sorting the array elements
        Array.Sort(arr);
     
        // To store modified array
        int []tempArr = new int[n];
         
        // Adding numbers from sorted array 
        // to new array accordingly
        int ArrIndex = 0;
     
        // Traverse from begin and end simultaneously
        for (int i = 0, j = n-1; i <= n / 2
             || j > n / 2; i++, j--) {
                                         
            if(ArrIndex < n)
            {
                tempArr[ArrIndex] = arr[i];
                ArrIndex++;
            }
             
            if(ArrIndex < n)
            {
                tempArr[ArrIndex] = arr[j];
                ArrIndex++;
            }
        }
     
        // Modifying original array
        for (int i = 0; i < n; i++)
            arr[i] = tempArr[i];
    }
     
    // Driver Code
    public static void Main(String []args)
    {
        int []arr = {5, 8, 1, 4, 2, 9, 3, 7, 6};
        int n = arr.Length;
        rearrangeArray(arr, n);
     
        for (int i = 0; i < n; i++)
        Console.Write(arr[i] + " ");
    }
}
 
// This code is contributed by Nitin Mittal.

PHP

 $n / 2;
         $i++, $j--)
    {
        $tempArr[$ArrIndex] = $arr[$i];
        $ArrIndex++;
        $tempArr[$ArrIndex] = $arr[$j];
        $ArrIndex++;
    }
 
    // Modifying original array
    for ($i = 0; $i < $n; $i++)
        $arr[$i] = $tempArr[$i];
     
    for ($i = 0; $i < $n; $i++)
        echo $arr[$i] . " ";
}
 
// Driver Code
$arr = array(5, 8, 1, 4, 2,
             9, 3, 7, 6 );
$n = count($arr) ;
rearrangeArray($arr, $n);
 
// This code is contributed
// by Sam007
?>

Javascript

 
// Javascipt program to prlet the
// array in given order
 
// Function which arrange the array.
function rearrangeArray(arr, n)
{
    // Sorting the array elements
    arr.sort();
 
    // To store modified array
    let tempArr = new Array(n);
     
    // Adding numbers from sorted array 
    // to new array accordingly
    let ArrIndex = 0;
 
    // Traverse from begin and end simultaneously
    for (let i = 0, j = n-1; i <= n / 2
         || j > n / 2; i++, j--) {
                                     
        if(ArrIndex < n)
        {
            tempArr[ArrIndex] = arr[i];
            ArrIndex++;
        }
         
        if(ArrIndex < n)
        {
            tempArr[ArrIndex] = arr[j];
            ArrIndex++;
        }
    }
 
    // Modifying original array
    for (let i = 0; i < n; i++)
        arr[i] = tempArr[i];
}
 
// Driver Code
 
let arr =[5, 8, 1, 4, 2, 9, 3, 7, 6]
let n = arr.length;
rearrangeArray(arr, n);
 
for (let i = 0; i < n; i++)
    document.write(arr[i] + " ");
 
 

输出：

1 9 2 8 3 7 4 6 5