#1024
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 |
![]() |
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #57463986 | Utilizator | |
Fișier | quicksort.cpp | Dimensiune | 794 B |
Data încărcării | 01 Aprilie 2025, 11:48 | Scor / rezultat | Eroare de compilare |
quicksort.cpp: In function 'void QuickSort(int*, int, int)': quicksort.cpp:12:9: error: expected ';' before 'int' int i = st;, j = dr, d = 0; ^ quicksort.cpp:12:20: error: expected primary-expression before ',' token int i = st;, j = dr, d = 0; ^ quicksort.cpp:12:22: error: 'j' was not declared in this scope int i = st;, j = dr, d = 0; ^ quicksort.cpp:12:30: error: 'd' was not declared in this scope int i = st;, j = dr, d = 0; ^ quicksort.cpp:13:15: error: 'i' was not declared in this scope while(i < j) ^ quicksort.cpp:25:26: error: 'i' was not declared in this scope QuickSort(v, st, i - 1); ^ quicksort.cpp: In function 'int main()': quicksort.cpp:32:5: error: 'cin' was not declared in this scope cin >> n; ^ quicksort.cpp:32:5: note: suggested alternative: In file included from quicksort.cpp:2:0: /usr/include/c++/4.8/iostream:60:18: note: 'std::cin' extern istream cin; /// Linked to standard input ^ quicksort.cpp:35:16: error: 'v' was not declared in this scope cin >> v[i]; ^ quicksort.cpp:37:19: error: invalid conversion from 'int' to 'int*' [-fpermissive] QuickSort(1, n); ^ quicksort.cpp:37:19: error: too few arguments to function 'void QuickSort(int*, int, int)' quicksort.cpp:4:6: note: declared here void QuickSort(int v[], int st, int dr) ^ quicksort.cpp:40:9: error: 'cout' was not declared in this scope cout << v[i] << " "; ^ quicksort.cpp:40:9: note: suggested alternative: In file included from quicksort.cpp:2:0: /usr/include/c++/4.8/iostream:61:18: note: 'std::cout' extern ostream cout; /// Linked to standard output ^ quicksort.cpp:40:17: error: 'v' was not declared in this scope cout << v[i] << " "; ^
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ă.