What are the advantages of bubble sort?
No Answer is Posted For this Question
Be the First to Post Answer
What are the advantage of collection classes over arrays?
What is the height of binary tree?
What is the complexity of arraylist?
Is hashtable fail fast?
write an algorithm to show the procedure of insertion into a b-tree?
What is the use of substring?
What is the difference between Array and Array List ? Explain in brief with example.
Does mentioning the array name gives the base address in all the contexts?
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.
Why is hashmap used?
Is an arraylist a vector?
How many types of searching are there in data structure?