Rezumat problemă

MergeSort

#1025

Se dă un șir cu n elemente, numere întregi. Folosind metoda MergeSort, ordonați crescător elementele acestui șir.

Consola Candale Silviu (silviu) medie

Clasa 10 Divide et Impera Algoritmi de sortare

Rezolvă

Detalii

Problema	MergeSort	Operații I/O	tastatură/ecran
Limita timp	0.3 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64867993	Utilizator	Vologa Medeea (Vologamedeea)
Fișier	mergesort.cpp	Dimensiune	665 B
Data încărcării	08 Iunie 2026, 15:10	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

mergesort.cpp: In function ‘void interclas(int, int, int)’:
mergesort.cpp:10:5: error: ‘whle’ was not declared in this scope
   10 |     whle(i<=m &&j<=q)
      |     ^~~~
mergesort.cpp:13:5: error: ‘else’ without a previous ‘if’
   13 |     else
      |     ^~~~
mergesort.cpp:15:16: error: ‘v’ was not declared in this scope
   15 |         c[++k]=v[i++];
      |                ^
mergesort.cpp:17:16: error: ‘v’ was not declared in this scope
   17 |         c[++k]=v[j++];
      |                ^
mergesort.cpp:16:5: warning: this ‘while’ clause does not guard... [-Wmisleading-indentation]
   16 |     while(j<=q)
      |     ^~~~~
mergesort.cpp:18:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘while’
   18 |         k=1;
      |         ^
mergesort.cpp:20:13: error: ‘v’ was not declared in this scope
   20 |             v[i]=c[k++];
      |             ^
mergesort.cpp: In function ‘void afis()’:
mergesort.cpp:36:21: error: ‘n’ was not declared in this scope
   36 |     for (int i=1;i<=n;i++)
      |                     ^

Cum funcționează evaluarea?