#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 | #50163479 | Utilizator | |
Fișier | mergesort.cpp | Dimensiune | 383 B |
Data încărcării | 29 Martie 2024, 10:36 | Scor / rezultat | Eroare de compilare |
mergesort.cpp: In function 'void MergeSort(int, int)': mergesort.cpp:4:5: error: 'dt' was not declared in this scope {if(dt<dr) ^ mergesort.cpp:8:2: error: 'i' was not declared in this scope i=st;j=mid=1;k=0; ^ mergesort.cpp:8:7: error: 'j' was not declared in this scope i=st;j=mid=1;k=0; ^ mergesort.cpp:8:15: error: 'k' was not declared in this scope i=st;j=mid=1;k=0; ^ mergesort.cpp:10:9: error: 'v' was not declared in this scope if(v[i]<v[j]) ^ mergesort.cpp:11:7: error: 'c' was not declared in this scope {k++;c[k]=b[i];i++;} ^ mergesort.cpp:11:12: error: 'b' was not declared in this scope {k++;c[k]=b[i];i++;} ^ mergesort.cpp:12:12: error: 'c' was not declared in this scope else {k++;c[k]=v[j];j++;} ^ mergesort.cpp:13:20: error: 'c' was not declared in this scope while(i<=mid){k++;c[k]=v[i];i++;} ^ mergesort.cpp:13:25: error: 'v' was not declared in this scope while(i<=mid){k++;c[k]=v[i];i++;} ^ mergesort.cpp:14:19: error: 'c' was not declared in this scope while(j<=dr){k++;c[k]=v[j];j++;} ^ mergesort.cpp:14:24: error: 'v' was not declared in this scope while(j<=dr){k++;c[k]=v[j];j++;} ^ mergesort.cpp:16:6: error: 'v' was not declared in this scope v[st+i-1]=c[i];} ^ mergesort.cpp:16:16: error: 'c' was not declared in this scope v[st+i-1]=c[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ă.