Question: C++ Please help 1) Illustrate how heap-sort is performed on the following array: 5,2,4,6,1,3 2) Consider the following un-weighted directed graph, Z: a. Is Z
C++ Please help

1) Illustrate how heap-sort is performed on the following array: 5,2,4,6,1,3 2) Consider the following un-weighted directed graph, Z: a. Is Z a Strongly-Connected graph? Is it Weekly-Connected? b. Write the adjacency list representation of Z
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
