MHB Selection Sort & Insertion Sort: Step-by-Step Guide to Sorting Data

[Henry R]

How to do this?

Show the step by step how the following data is sorted into ascending order using the given sorting algorithm :

22 85 43 28 65 35

i) Selection sort.
ii) Insertion Sort.

 

[evinda]

How to do this?

Show the step by step how the following data is sorted into ascending order using the given sorting algorithm :

22 85 43 28 65 35

i) Selection sort.
ii) Insertion Sort.

Have you seen these algorithms in class?

 

[Henry R]

Have you seen these algorithms in class?

yes. It's about sorting.

- - - Updated - - -

Have you seen these algorithms in class?

Yeah. They talk about quick sort, simple selection sort and something like that.

 

[PvsNP]

How to do this?

Show the step by step how the following data is sorted into ascending order using the given sorting algorithm :

22 85 43 28 65 35

i) Selection sort.
ii) Insertion Sort.

The Wikipedia pages on these two sorting methods not only have text examples, but also .gifs to illustrate how they work.

Best way to analyse these algorithms step by step is to obtain the pseudocode and then work through it step by step using a pen and paper. Your list only contains 6 elements so it won't take long to do it manually. You'll also gain a much better understanding of the algorithms this way.