Answer / Nitesh Kumar Sharma

For small data sets, quicksort or insertionsort are often considered the most efficient sorting algorithms due to their average and worst-case time complexity of O(n log n). However, insertionsort performs better when the input data set is already sorted or nearly sorted.

Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.

1 Answers   Expedia,

---

What is a stable algorithm?

1 Answers  

---

What is an example of an algorithm?

1 Answers  

---

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.

3 Answers  

---

What is b tree in data structure?

1 Answers  

---

How do I sort a hashmap key?

1 Answers  

---

In what areas do data structures applied?

1 Answers  

---

Define left-in threaded tree?

1 Answers  

---

What do you mean by union-by-weight?

1 Answers  

---

Can hashmap have same key?

1 Answers  

---

How are elements stored in hashset?

1 Answers  

---

Can we modify final arraylist?

1 Answers  

---