#1024
QuickSort
Se dă un șir cu n
elemente, numere întregi. Folosind metoda QuickSort, ordonați crescător elementele acestui șir.
Problema | QuickSort | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #20814447 | Utilizator | |
Fișier | quicksort.cpp | Dimensiune | 421 B |
Data încărcării | 11 Februarie 2020, 12:48 | Scor / rezultat | Eroare de compilare |
quicksort.cpp:1:9: error: #include expects "FILENAME" or <FILENAME> #include <iostream> ^ quicksort.cpp:2:1: error: stray '\302' in program using namespace std; ^ quicksort.cpp:2:1: error: stray '\240' in program quicksort.cpp:2:1: error: stray '\302' in program quicksort.cpp:2:1: error: stray '\240' in program quicksort.cpp:5:5: error: stray '\302' in program int pivot (int x[],int p,int u) ^ quicksort.cpp:5:5: error: stray '\240' in program quicksort.cpp: In function 'int main()': quicksort.cpp:6:5: error: expected initializer before 'i' i=p, j=u, di=0, dj=1; ^ quicksort.cpp:7:8: error: 'i' was not declared in this scope while (i<j) ^ quicksort.cpp:7:10: error: 'j' was not declared in this scope while (i<j) ^ quicksort.cpp:8:8: error: 'x' was not declared in this scope if(x[i]>x[j]) ^ quicksort.cpp:10:5: error: 'aux' was not declared in this scope aux=x[i];x[i]-x[j];x[j]=aux; ^ quicksort.cpp:11:9: error: 'di' was not declared in this scope aux=di; di=dj; dj=aux; ^ quicksort.cpp:11:16: error: 'dj' was not declared in this scope aux=di; di=dj; dj=aux; ^ quicksort.cpp:13:5: error: 'i' was not declared in this scope i=i+di; ^ quicksort.cpp:13:9: error: 'di' was not declared in this scope i=i+di; ^ quicksort.cpp:14:5: error: 'j' was not declared in this scope j=j-dj; ^ quicksort.cpp:14:9: error: 'dj' was not declared in this scope j=j-dj; ^ quicksort.cpp: At global scope: quicksort.cpp:16:1: error: expected unqualified-id before 'return' return i; ^ quicksort.cpp:17:1: error: expected declaration before '}' token } ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema QuickSort face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.