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	#64748525	Utilizator	stoica david (stoicadavid)
Fișier	mergesort.cpp	Dimensiune	1.35 KB
Data încărcării	27 Mai 2026, 16:34	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

mergesort.cpp:40:5: error: redefinition of ‘int n’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |     ^
mergesort.cpp:4:5: note: ‘int n’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |     ^
mergesort.cpp:40:7: error: redefinition of ‘int a [100005]’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |       ^
mergesort.cpp:4:7: note: ‘int a [100005]’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |       ^
mergesort.cpp:40:17: error: redefinition of ‘int i’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |                 ^
mergesort.cpp:4:17: note: ‘int i’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |                 ^
mergesort.cpp:40:19: error: redefinition of ‘int j’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |                   ^
mergesort.cpp:4:19: note: ‘int j’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |                   ^
mergesort.cpp:40:21: error: redefinition of ‘int k’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |                     ^
mergesort.cpp:4:21: note: ‘int k’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |                     ^
mergesort.cpp:40:23: error: redefinition of ‘int b [200005]’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |                       ^
mergesort.cpp:4:23: note: ‘int b [200005]’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |                       ^
mergesort.cpp:40:33: error: redefinition of ‘int t’
   40 | int n,a[100005],i,j,k,b[200005],t;
      |                                 ^
mergesort.cpp:4:33: note: ‘int t’ previously declared here
    4 | int n,a[100005],i,j,k,b[200005],t;
      |                                 ^
mergesort.cpp:41:6: error: redefinition of ‘void sort(int, int)’
   41 | void sort(int st,int dr)
      |      ^~~~
mergesort.cpp:5:6: note: ‘void sort(int, int)’ previously defined here
    5 | void sort(int st,int dr)
      |      ^~~~
mergesort.cpp:50:6: error: redefinition of ‘void interclas(int, int, int)’
   50 | void interclas(int st,int mij,int dr)
      |      ^~~~~~~~~
mergesort.cpp:14:6: note: ‘void interclas(int, int, int)’ previously defined here
   14 | void interclas(int st,int mij,int dr)
      |      ^~~~~~~~~
mergesort.cpp:62:5: error: redefinition of ‘int main()’
   62 | int main()
      |     ^~~~
mergesort.cpp:26:5: note: ‘int main()’ previously defined here
   26 | int main()
      |     ^~~~

Cum funcționează evaluarea?