#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 | #50164022 | Utilizator | |
Fișier | mergesort.cpp | Dimensiune | 504 B |
Data încărcării | 29 Martie 2024, 10:47 | Scor / rezultat | Eroare de compilare |
mergesort.cpp: In function 'int MergeSort(int, int)': mergesort.cpp:8:9: error: 'i' was not declared in this scope i=st; j=mid+1; ^ mergesort.cpp:8:15: error: 'j' was not declared in this scope i=st; j=mid+1; ^ mergesort.cpp:11:16: error: 'v' was not declared in this scope if(v[i]<v[j]{ k++; c[k]=v[i]; j++;} ^ mergesort.cpp:11:25: error: expected ')' before '{' token if(v[i]<v[j]{ k++; c[k]=v[i]; j++;} ^ mergesort.cpp:13:9: error: expected primary-expression before '}' token } ^ mergesort.cpp:13:9: error: expected ';' before '}' token mergesort.cpp:15:17: error: 'k' was not declared in this scope {k++; c[k]=v[i];++i} ^ mergesort.cpp:15:22: error: 'c' was not declared in this scope {k++; c[k]=v[i];++i} ^ mergesort.cpp:15:27: error: 'v' was not declared in this scope {k++; c[k]=v[i];++i} ^ mergesort.cpp:15:35: error: expected ';' before '}' token {k++; c[k]=v[i];++i} ^ mergesort.cpp:17:17: error: 'k' was not declared in this scope {k++;c[k]=v[j];++j} ^ mergesort.cpp:17:21: error: 'c' was not declared in this scope {k++;c[k]=v[j];++j} ^ mergesort.cpp:17:26: error: 'v' was not declared in this scope {k++;c[k]=v[j];++j} ^ mergesort.cpp:17:34: error: expected ';' before '}' token {k++;c[k]=v[j];++j} ^ mergesort.cpp:18:20: error: 'k' was not declared in this scope for(i=1;i<=k;++i) ^ mergesort.cpp:19:17: error: 'v' was not declared in this scope {v[st+i-1]=c[i];} ^ mergesort.cpp:19:27: error: 'c' was not declared in this scope {v[st+i-1]=c[i];} ^ mergesort.cpp:21:2: warning: no return statement in function returning non-void [-Wreturn-type] } ^
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ă.