Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
the reason HTML seems to work even if it has syntax errors is due to browser having built in ways to parse the code meaning it will still show but most likely look way different then you would want.
the code may turn pink due to syntax errors
<span>b. In
Slide Sorter view, the user can zoom in to read text on slides more
easily or zoom out to see more of the presentation’s slides at once.
Moreover, in Normal View, the number of slides that you can see together at once is quite less, so it is more advantageous to use the Slide Sorter View to sort your slides
</span>
Answer:
int costOfBusRental;
int maxBusRiders;
int costPerRider;
costPerRider = costOfBusRental/maxBusRiders;
Explanation:
The costPerRider is the total cost of renting the bus (costofBusRental) divided by all the bus users (maxBusRiders). So we declare the three variables to be of type int as required by the question.
