Q1: Sort the following array using Heap sort i.e. i. S,0,R,T,I,N,G Q 2: Sort the following using merge sort: 85, 24, 63, 45, 17, 31, 96, 50 Q 3: Write an algorithm for Quick Sort. Q 4: Find the...

Q1: Sort the following array using Heap sort i.e.<br>i. S,0,R,T,I,N,G<br>Q 2: Sort the following using merge sort: 85, 24, 63, 45, 17, 31, 96, 50<br>Q 3: Write an algorithm for Quick Sort.<br>Q 4: Find the minimum spanning tree using Kruskal's Algorithm.<br>A<br>10<br>D<br>3<br>B<br>6<br>4<br>4<br>1<br>H<br>F<br>G<br>5.<br>3)<br>6,<br>2.<br>

Extracted text: Q1: Sort the following array using Heap sort i.e. i. S,0,R,T,I,N,G Q 2: Sort the following using merge sort: 85, 24, 63, 45, 17, 31, 96, 50 Q 3: Write an algorithm for Quick Sort. Q 4: Find the minimum spanning tree using Kruskal's Algorithm. A 10 D 3 B 6 4 4 1 H F G 5. 3) 6, 2.

Jun 07, 2022

SOLUTION.PDF

Q1: Sort the following array using Heap sort i.e. i. S,0,R,T,I,N,G Q 2: Sort the following using merge sort: 85, 24, 63, 45, 17, 31, 96, 50 Q 3: Write an algorithm for Quick Sort. Q 4: Find the...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment