#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 | tastatură/ecran |
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #49728047 | Utilizator | |
Fișier | mergesort.cpp | Dimensiune | 535 B |
Data încărcării | 13 Martie 2024, 12:40 | Scor / rezultat | Eroare de compilare |
mergesort.cpp:15:31: error: redefinition of 'int ld' void interclasare(int ld, int ld, int m) ^ mergesort.cpp:15:23: error: 'int ld' previously declared here void interclasare(int ld, int ld, int m) ^ mergesort.cpp: In function 'void interclasare(int, int)': mergesort.cpp:17:11: error: 'ls' was not declared in this scope int i=ls, j=m+1, k=0, b[100001]; ^ mergesort.cpp:18:19: error: 'j' was not declared in this scope while(i<=m && j<=ld) ^ mergesort.cpp:19:22: error: 'b' was not declared in this scope if(a[i]<a[j]) b[++k]=a[i++]; ^ mergesort.cpp:19:26: error: 'k' was not declared in this scope if(a[i]<a[j]) b[++k]=a[i++]; ^ mergesort.cpp:20:14: error: 'b' was not declared in this scope else b[++k]=a[j++]; ^ mergesort.cpp:20:18: error: 'k' was not declared in this scope else b[++k]=a[j++]; ^ mergesort.cpp:22:17: error: 'b' was not declared in this scope while(i<=m) b[++k]=a[i++]; ^ mergesort.cpp:22:21: error: 'k' was not declared in this scope while(i<=m) b[++k]=a[i++]; ^ mergesort.cpp:23:11: error: 'j' was not declared in this scope while(j<=ld) b[++k]=a[j++]; ^ mergesort.cpp:23:18: error: 'b' was not declared in this scope while(j<=ld) b[++k]=a[j++]; ^ mergesort.cpp:23:22: error: 'k' was not declared in this scope while(j<=ld) b[++k]=a[j++]; ^ mergesort.cpp:25:34: error: 'b' was not declared in this scope for(int i=ls;i<=ld;i++) a[i]=b[l++]; ^ mergesort.cpp: At global scope: mergesort.cpp:28:1: error: 'voidd' does not name a type voidd sortare( ^
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ă.