For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why? 3 marks
2. How heap sort works to set a set of data 2 marks
1. union(1,2)
2. union(3,5)
3. union(7,2)
4. union(8,9)
5. union(14,15)
6. union(16,17)
7. union(14,17)
union by weight method 5marks
binary tree dia gaya the us men c ek node ko delete kr dia jata hye tree balance krna tha
how heap sort works to set a set of data2 marks
tree dia howa tha us ka inorder aur preorder traversal krna tha 5 marks
1. What is an Equivalent relation? 2 marks
bas itna he yad hye
Comments
Post a Comment
Please give us your feedback & help us to improve this site.