Haldiram Bhujiawala Junior Java Developer Interview Questions and Answers

Difference between stack and queue

Q1. Complexity of merge sort
Ans. 
Merge sort has a time complexity of O(n log n) and is a divide and conquer algorithm.
• Divides the array into two halves recursively

• Sorts the two halves separately

• Merges the sorted halves to produce the final sorted array

• Uses extra space for merging

• Suitable for sorting linked lists

• Example: Sorting an array of 10 elements takes 30 comparisons and 3 merge operations
Answered by AI
Add your answer
Q2. Complexity of quick sort
Ans. 
Quick sort has an average time complexity of O(n log n) and worst case complexity of O(n^2).
• Quick sort is a divide-and-conquer algorithm that recursively partitions an array into smaller sub-arrays.

• It selects a pivot element and partitions the array around the pivot, with elements smaller than the pivot to its left and larger to its right.

• The pivot is then placed in its final position and the algorithm is applied to th...read more
Answered by AI
Add your answer

Q1. This is a question which might be going to ask
Add your answer
Q2. Answer is the one with question
Add your answer