Problem

1/7

Tri rapide : Démarrer (C++)

Theory Click to read/hide

Error

Problem

Soit N (1 <= N <= 100000) suivi de N nombres naturels de 1 à < code>100< /code>. Afficher les nombres N dans un ordre non décroissant.
 
Exemples
5
3 1 2 4 2
# Entrée Sortie
1 1 2 2 3 4


time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
using namespace std;

void quickSrt(int arr[], int left, int right) {              
}

int main()
{
	int n;
	cin>>n;
	int* a = new int[n];
	for(int i = 0 ; i < n ; i ++)
	{
	  	cin>>a[i];
	}
	quickSrt(a,0,n-1);
        for(int i = 0 ; i < n ; i ++)
	{
	    cout<<a[i]<<" ";
	}	  
}

     

Program check result

To check the solution of the problem, you need to register or log in!