Problem

1/8

Quicksort: inizio (Python)

Theory Click to read/hide

Error

Problem

Dato N (1 <= N <= 100000) seguito da N numeri naturali da 1 a < code>100< /code>. Stampa N numeri in ordine non decrescente.
 
Esempi
# Input Uscita
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 
def QS(A, st, end):                   
n = int(input())
a = list(map(int, input().split()))
QS(a, 0, n-1)
print(*a)

     

Program check result

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