#1025
MergeSort
Se dă un șir cu n
elemente, numere întregi. Folosind metoda MergeSort, ordonați crescător elementele acestui șir.
Problema | MergeSort | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #57977126 | Utilizator | |
Fișier | mergesort.cpp | Dimensiune | 1.00 KB |
Data încărcării | 06 Mai 2025, 12:55 | Scor / rezultat | Eroare de compilare |
mergesort.cpp:5:35: error: size of array 'a' is too large int n,m,x,v1[101],a[10000000000001],v[20000000000001]; ^ mergesort.cpp:5:53: error: size of array 'v' is too large int n,m,x,v1[101],a[10000000000001],v[20000000000001]; ^ mergesort.cpp: In function 'void interclasare(int, int, int)': mergesort.cpp:10:13: error: 'v' was not declared in this scope if (v[i]<v[j]){ ^ mergesort.cpp:12:13: error: 'a' was not declared in this scope a[k]=v[i]; ^ mergesort.cpp:17:13: error: 'a' was not declared in this scope a[k]=v[j]; ^ mergesort.cpp:24:13: error: 'a' was not declared in this scope a[k]=v[t]; ^ mergesort.cpp:24:18: error: 'v' was not declared in this scope a[k]=v[t]; ^ mergesort.cpp:30:13: error: 'a' was not declared in this scope a[k]=v[t]; ^ mergesort.cpp:30:18: error: 'v' was not declared in this scope a[k]=v[t]; ^ mergesort.cpp:36:9: error: 'v' was not declared in this scope v[t]=a[i]; ^ mergesort.cpp:36:14: error: 'a' was not declared in this scope v[t]=a[i]; ^ mergesort.cpp: In function 'int main()': mergesort.cpp:54:35: error: 'v' was not declared in this scope for (int i=1; i<=n; i++) cin>>v[i]; ^ mergesort.cpp:56:32: error: 'v' was not declared in this scope for(int t=1;t<=n;t++)cout<<v[t]<<" "; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema MergeSort 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ă.