Pseudo code here
int i;
for(i=2,i<=10;i++)
{
print 1/i;
}
i = 2;
while (i <= 10)
{
print 1/i;
i++;
}
Answer:
- Iterate over the Bellman-Ford algorithm n-1 time while tracking the parent vertex and store in an array.
- Do another iteration and if no relaxation of the edges occurs in the nth iteration then print of return "There are no negative cycle".
- Else, store the vertex of the relaxed edge at the nth iteration with a variable name.
- Then iterate over the vertexes starting from the store vertex until a cycle is found then print it out as the cycle of negative weight.
Explanation:
The Bellman-Ford algorithm can be used to detect a negative cycle in a graph. The program should iterate over the algorithm, in search of a relaxed edge. If any, the vertex of the specified edge is used as a starting point to get the target negative cycle.
Answer:
for(i = 0 ; i < NUM_VALS; ++i)
{
cout << courseGrades[i] << " ";
}
cout << endl;
for(i = NUM_VALS-1 ; i >=0 ; --i)
{
cout << courseGrades[i] << " ";
}
cout << endl;
Explanation:
The first loop initializes i with 0, because we have to print the elements in order in which the appear in the array. We print each element, adding a space (" ") character at its end. After the loop ends, we add a new line using endl.
The second loop will print the values in a reverse order, so we initialize it from NUM_VALS-1, (since NUM_VALS = 4, and array indices are 0,1,2,3). We execute the loop till i >= 0, and we print the space character and new line in a similar way we executed in loop1.
A computer chip is a data space stored on your computer. It is there to to keep all of your computer information in it therefor. A computer chip works with your computer to help it work.
