Problem

1/8

Quicksort: start (Python)

Theory Click to read/hide

Error

Problem

Given N (1 <= N <= 100000) followed by N natural numbers from 1 to < code>100. Print N numbers in non-decreasing order.
 
Examples
# Input Output
1
5
3 1 2 4 2
 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
Python
Write the program below 
#include <iostream>
using namespace std;

void quickSort(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];
	  }
	 quickSort(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!