#1025
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 | #57355304 | Utilizator | |
Fișier | mergesort.cpp | Dimensiune | 841 B |
Data încărcării | 27 Martie 2025, 11:04 | Scor / rezultat | Eroare de compilare |
mergesort.cpp: In function 'void interclasare(int, int, int)': mergesort.cpp:9:12: error: 'a' was not declared in this scope if(a[i]<a[j]) ^ mergesort.cpp:10:13: error: 'c' was not declared in this scope c[k++]=a[i++]; ^ mergesort.cpp:12:13: error: 'c' was not declared in this scope c[k++]=a[j++]; ^ mergesort.cpp:15:9: error: 'c' was not declared in this scope c[k++]=a[i++]; ^ mergesort.cpp:15:16: error: 'a' was not declared in this scope c[k++]=a[i++]; ^ mergesort.cpp:17:9: error: 'c' was not declared in this scope c[k++]=a[j++]; ^ mergesort.cpp:17:16: error: 'a' was not declared in this scope c[k++]=a[j++]; ^ mergesort.cpp:18:16: warning: suggest parentheses around assignment used as truth value [-Wparentheses] for(i=1; j=st; j<=dr; i++; j++) ^ mergesort.cpp:18:21: warning: for increment expression has no effect [-Wunused-value] for(i=1; j=st; j<=dr; i++; j++) ^ mergesort.cpp:18:25: error: expected ')' before ';' token for(i=1; j=st; j<=dr; i++; j++) ^ mergesort.cpp:18:35: error: expected ';' before ')' token for(i=1; j=st; j<=dr; i++; j++) ^ mergesort.cpp: In function 'void sortare(int, int)': mergesort.cpp:26:12: error: 'a' was not declared in this scope if(a[st]>a[dr]) ^ mergesort.cpp: In function 'int main()': mergesort.cpp:39:10: error: 'n' was not declared in this scope cin>>n; ^ mergesort.cpp:41:14: error: 'a' was not declared in this scope cin>>a[i]; ^ mergesort.cpp:43:9: error: 'i' was not declared in this scope for(i=1; i<=n; i++) ^ mergesort.cpp:44:15: error: 'a' was not declared in this scope cout<<a[i]<<' '; ^
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ă.