int i, j, k; mid - left + 1; right - mid; int Le[a], Ri[b]; for (i = 0; i < a; i++) Le[i] = x[left + i]; for (j = 0; j < b; j#) Ri[j] i = 0; int a = int b = x[mid + 1 + j]; %3D j = 0;

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

Need help fixing those lines of code. C++

abt E0028
ERPHMS
ERPHMS.cpp
expression must have a constant value
the value of variable "a" (declared at line 310) cannot be used as a constant
312
Abr E0028
expression must have a constant value
ERPHMS
ERPHMS.cpp
312
Transcribed Image Text:abt E0028 ERPHMS ERPHMS.cpp expression must have a constant value the value of variable "a" (declared at line 310) cannot be used as a constant 312 Abr E0028 expression must have a constant value ERPHMS ERPHMS.cpp 312
Evoid merge (int x[], int left, int mid, int right)
{
int i, j, k;
int a = mid
left + 1;
int b =
right - mid;
int Le[a], Ri[b];
for (i = 0; i < a; i+)
Le[i] = x[left + i];
for (j = 0; j < b; j+)
Ri[j] = x[mid + 1 + j];
i = 0;
j = 0;
k = left;
while (i < a && j < b)
{
if (Le[i] <= Ri[j])
{
x[k]
Le[i];
it;
}
else
{
x[k] = Ri[j];
j+;
}
kt;
while (i < a)
{
x[k] = Le[i];
i++;
%3D
k+t;
}
while (j < a)
{
x[k] = Ri[j];
j+;
kt;
}
avoid mergeSort(int x[], int 1, int r)
{
if (1 < r)
{
int m = 1 + (r - 1) / 2;
mergeSort(x, 1, m);
mergeSort(x, m + 1, r);
merge (x, 1, m, r);
}
Transcribed Image Text:Evoid merge (int x[], int left, int mid, int right) { int i, j, k; int a = mid left + 1; int b = right - mid; int Le[a], Ri[b]; for (i = 0; i < a; i+) Le[i] = x[left + i]; for (j = 0; j < b; j+) Ri[j] = x[mid + 1 + j]; i = 0; j = 0; k = left; while (i < a && j < b) { if (Le[i] <= Ri[j]) { x[k] Le[i]; it; } else { x[k] = Ri[j]; j+; } kt; while (i < a) { x[k] = Le[i]; i++; %3D k+t; } while (j < a) { x[k] = Ri[j]; j+; kt; } avoid mergeSort(int x[], int 1, int r) { if (1 < r) { int m = 1 + (r - 1) / 2; mergeSort(x, 1, m); mergeSort(x, m + 1, r); merge (x, 1, m, r); }
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY