C-Facebook, LinkedIn, Twitter, etc
Explanation:
The statement which says that a graph is complete means an undirected graph whose every pair of vertices is connected by an particular edge or unique edge.
An undirected graph is a graph whose edges soea not contain any direction means to which vertex they are directed.
A complete graph has an edge between every pair of vertices that exist in that graph.
Answer:
3
Explanation:
Heap sort pick an item from the first or last position in an array and compares it with other items in other positions in the array, swapping position if they meet the condition.
The array above has three maximum items arranged sequentially in the array, this is prove that there have been 3 reheapifications in the array.
No probably not to be honest
num1 = some value
num2 = some value
if num1 == num2:
print("equal")
You just need to provide the values for the numbers. I hope this helps!