Programming Concepts 006

Question 1

Bubble sort

Answer 1

check first the check second if second is smaller then first switch them

Question 2

Merge sort

Answer 2

first separate them into duos then singles and then combine them in order

Question 3

Insertion sort

Answer 3

separate into sorted que and unsorted que. Put each next one individually from unsorted to sorted que by checking if the one you are about to put bigger or smaller then the previus one then moving it back enought where it isnt as big as the one before it or bigger then the one before it.