How do you find the complexity of a bubble sort?
No Answer is Posted For this Question
Be the First to Post Answer
Explain the sorting algorithm that is most suitable to be used with single linked list?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
Define double linked list?
What is the use of sorting the data?
Is hashmap an array?
I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.
Discuss the difference between a stack and an Array?
Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.
Which sorting technique is faster?
How do I use quick sort?
What are common data structures?
Which is faster hashset or treeset?