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

In summary, the conversation discusses how to sort data using selection sort and insertion sort algorithms. It is suggested to refer to the Wikipedia pages for these methods and analyze them step by step using pseudocode to gain a better understanding.
  • #1
Henry R
25
0
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.
 
Technology news on Phys.org
  • #2
Henry R said:
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?
 
  • #3
evinda said:
Have you seen these algorithms in class?

yes. It's about sorting.

- - - Updated - - -

evinda said:
Have you seen these algorithms in class?

Yeah. They talk about quick sort, simple selection sort and something like that.
 
  • #4
Henry R said:
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.
 
  • #5


Step-by-Step Guide to Sorting Data Using Selection Sort:

1. Begin by setting the first element as the minimum value (in this case, 22).
2. Compare the minimum value with the rest of the elements in the list.
3. If a smaller value is found, swap it with the minimum value.
4. Repeat this process until the end of the list is reached.
5. Once the end of the list is reached, the minimum value will be in the first position.
6. Move on to the next element and repeat steps 2-5 until the entire list is sorted.

Step 1: 22 85 43 28 65 35
Minimum value: 22

Step 2: 22 85 43 28 65 35
Minimum value: 22

Step 3: 22 85 43 28 65 35
Minimum value: 22

Step 4: 22 85 43 28 65 35
Minimum value: 22

Step 5: 22 85 43 28 65 35
Minimum value: 22

Step 6: 22 28 43 85 65 35
Minimum value: 28

Step 7: 22 28 43 85 65 35
Minimum value: 28

Step 8: 22 28 35 85 65 43
Minimum value: 35

Step 9: 22 28 35 43 65 85
Minimum value: 43

Step 10: 22 28 35 43 65 85
Minimum value: 43

Step 11: 22 28 35 43 65 85
Minimum value: 43

Step 12: 22 28 35 43 65 85
Minimum value: 43

Step 13: 22 28 35 43 65 85
Minimum value: 43

Step 14: 22 28 35
 

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

1. What is Selection Sort and how does it work?

Selection Sort is a sorting algorithm that works by repeatedly finding the minimum element from the unsorted part of the list and placing it at the beginning of the list. This process is repeated until the list is sorted.

2. What is the time complexity of Selection Sort?

The time complexity of Selection Sort is O(n^2), where n is the number of elements in the list. This means that the algorithm takes longer to sort longer lists, making it less efficient for large datasets.

3. What is Insertion Sort and how does it work?

Insertion Sort is a sorting algorithm that works by dividing the list into two parts - sorted and unsorted. It then takes an element from the unsorted part and inserts it into the correct position in the sorted part. This process is repeated until the list is fully sorted.

4. What is the time complexity of Insertion Sort?

The time complexity of Insertion Sort is also O(n^2), making it less efficient for large datasets. However, it has a better average-case performance compared to Selection Sort.

5. How do I choose between Selection Sort and Insertion Sort for my data?

The choice between Selection Sort and Insertion Sort depends on the size and order of your data. If your data is already partially sorted, Insertion Sort may be a better choice as it has a better average-case performance. However, if your data is completely unsorted, Selection Sort may be a better option as it has a consistent time complexity regardless of the order of the data.

Similar threads

  • Programming and Computer Science
Replies
6
Views
840
  • Programming and Computer Science
Replies
8
Views
1K
  • Programming and Computer Science
Replies
13
Views
2K
  • Programming and Computer Science
Replies
7
Views
539
  • Programming and Computer Science
Replies
10
Views
3K
  • Programming and Computer Science
Replies
7
Views
3K
  • Programming and Computer Science
Replies
5
Views
961
  • Programming and Computer Science
Replies
6
Views
4K
  • Programming and Computer Science
Replies
3
Views
1K
  • Programming and Computer Science
Replies
5
Views
3K
Back
Top