Answer:
In ADT graph the efficiency of addVertex has efficiency O(logn).
Explanation:
The time complexity of the method addvertex in ADT graph is O(logn). addVertex method has time complexity of O(logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.
hence we conclude that the answer is O(logn).
Answer:
Look down below for answer!
Explanation:
1. The internet has backup files and a greater authoritative figure can easily see the history on the photo, etc. Some apps have save files no matter what and can track the post, photo, and when and why it was deleted. The impression the photo left on people may not be left either.
2. The zoo can be breaking the law because even though they store the information safely, they do not have the visitors consent to having their information.
Answer:
What's the correct position to put your hands on the keyboard?
Explanation:
