Explain quick sort and merge sort algorithms.
- 0 Answers
- 572 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
More Data Structures Interview Questions
Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?
Why do we use arrays?
Is hashmap ordered?
What is the idea behind splaying?
Which sort show the best average behavior?
List the area of applications where stack data structure can be used?
What is bitonic search?
What is height balanced tree?
What is the two-dimensional array?
Can I provide array size dynamically?
What is two-dimensional array?
Does set allow null values?
Windows 
