Sort Algorithm

Question 1

Insertion Sort :

Answer 1

Question 2

Bubble Sort :

Answer 2

Question 3

Selection Sort : put the biggest number to the end of the list

Answer 3

Question 4

How to implement Insertion Sort : by defining two functions

Hints :
1.all datas bigger than key move to rear
2.insert until find data smaller than key

Answer 4

Question 5

What’s merge sort?

Answer 5

Question 6

How to implement Merge function ?

1.Create left & right array
2.Compare & add
3. Add rest numbers

Answer 6

Question 7

What’s heap?

Answer 7

Question 8

How does heapitfy looks like?

Answer 8

index defined rule you have to know :

Question 9

How to implement heapitfy in C ?

Answer 9

Question 10

How to implement heap sort in C?

Answer 10

Question 11

What’re the procedures of heap sort?

Answer 11

Question 12

How to implement binary insertion sort in C?

Answer 12

Question 13

How to implement shell sort ?

Answer 13

Question 14

How to implement shell sort in C ?

Answer 14

Question 15

What’s radix sort in sumary ?

Answer 15

Question 16

How to elucidate the four for loops for implementing Radix Sort?

Answer 16

Question 17

How to implement Radix Sort in C ?

Hints : the crux function of Radix Sort

Answer 17

Question 18

Radix Sort : implemented in C

Answer 18

Question 19

How to implement Quick Sort?

Answer 19

Question 20

How to implementQuick Sort in C ?

Answer 20

Question 21

Selection Sort : find the smallest number

Answer 21

Question 22

What’s the categories of sort algorithm?

Answer 22