Borderou de evaluare (job #2898351)
Utilizator | Data | 6 mai 2022 16:50:25 | |
---|---|---|---|
Problema | Sortare prin comparare | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void merge(int, int, int)':
main.cpp:15:17: error: 'array' was not declared in this scope
15 | v1[i] = array[left + i];
| ^~~~~
main.cpp:4:1: note: 'std::array' is defined in header '<array>'; did you forget to '#include <array>'?
3 | #include <string.h>
+++ |+#include <array>
4 | using namespace std;
main.cpp:17:17: error: 'array' was not declared in this scope
17 | v2[j] = array[mid + 1 + j];
| ^~~~~
main.cpp:17:17: note: 'std::array' is defined in header '<array>'; did you forget to '#include <array>'?
main.cpp:24:13: error: 'array' was not declared in this scope
24 | array[k] = v1[i];
| ^~~~~
main.cpp:24:13: note: 'std::array' is defined in header '<array>'; did you forget to '#include <array>'?
main.cpp:28:13: error: 'array' was not declared in this scope
28 | array[k] = v2[j];
| ^~~~~
main.cpp:28:13: note: 'std::array' is defined in header '<array>'; did you forget to '#include <array>'?
main.cpp:34:9: error: 'array' was not declared in this scope
34 | array[k] = v1[i];
| ^~~~~
main.cpp:34:9: note: 'std::array' is defined in header '<array>'; did you forget to '#include <array>'?
main.cpp:39:9: error: 'array' was not declared in this scope
39 | array[k] = v2[j];
| ^~~~~
main.cpp:39:9: note: 'std::array' is defined in header '<array>'; did you forget to '#include <array>'?
main.cpp: In function 'int main()':
main.cpp:62:15: error: invalid conversion from 'int*' to 'int' [-fpermissive]
62 | mergeSort(arr, 0, n - 1);
| ^~~
| |
| int*
main.cpp:62:28: error: too many arguments to function 'void mergeSort(int, int)'
62 | mergeSort(arr, 0, n - 1);
| ^
main.cpp:45:6: note: declared here
45 | void mergeSort(int begin, int end)
| ^~~~~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !