The answer to this question is 3,2,1
Answer:
Algorithm explained below
Explanation:
Algorithm to check duplicate when list of element is sorted:
CheckDuplicate( Sorted list )
initialize count = 0
Repeat untill we reach on end of list :
if next is not end of list and current element is equal to next element
count = count+1
increase the pointer to next untill a different element is found
end CheckDuplicate
Worst Case Time Complexity will be O(n). Because there is only one iteration over the list will be performed.
Yes We have improved the worst case time complexity compared to previous question.
Actually after applying sorting all the similar element to will be next to each other.Then we will start iterating one by one from one side and check which is similar to next.If a different element will be find then we will check whether it's next is similar to it or not.
eg. 1 1 1 2 2 2 4 4 4 we can check duplicate in one iteration.
You can add a bookmark by clicking the star icon
<u>Explanation:</u>
Sometime you may have to visit a same page many times. It will be very difficult to search every time and go to the same page. It will be waste of time. Hence, there is an option available so that you can visit the page that you want to access many time without wasting your time.
In order to visit the page that you want to access more frequently you can use two ways. Most of the browsers will support to visit the most frequently accessed websites using the keyboard shortcuts Ctrl+D. You can also click on the star icon that is present in the address bar of the browser's top portion.
Answer: Outputs; Outcomes.
Explanation:
Program refers to the collection of instructions which the computer can execute in order to perform a certain task.
Outputs are are the countable products resulting from a program, while on the other hand, outcomes are the changes in clients that are achieved as a result of program participation.
Answer:
A. domain adminsb because maybe it might be the right answer.
