To write a program to perform selection sort and insertion sort using python programming.
- Hardware – PCs
- Anaconda – Python 3.7 Installation / Moodle-Code Runner
- Set the first unsorted element as the minimum
- For each of the unsorted elements, check if the element < current minimum.
- If yes, set the element as the new minimum.
- Swap minimum with first unsorted position.
- Repeat the steps 2 and 3 for all the elements in the array.
- Set the first element as sorted element j.
- For each unsorted element X, check if current sorted element j >X.
- If yes, move sorted element to the right by 1.
- Break the loop and insert X.
- Repeat the steps 2 to 4 for sorting all the elements in the array.
Program to sort the elements in the list using the Selection Sort algorithm.
Developed by:Rajesh A
RegisterNumber: 22008551
def selectionSort(array, size):
for ind in range(size):
min_index = ind
for j in range(ind + 1, size):
if array[j] < array[min_index]:
min_index = j
(array[ind], array[min_index]) = (array[min_index], array[ind])
arr = eval(input())
size = len(arr)
selectionSort(arr, size)
print(arr)
Program to sort the elements in the list using the Insertion Sort algorithm.
Developed by: your name: Rajesh A
RegisterNumber: 22008551
def insertion_sort(nums):
for i in range(1,len(nums)):
item_to_insert=nums[i]
j=i-1
while j >=0 and nums[j] > item_to_insert:
nums[j+1]=nums[j]
j-=1
nums[j+1]=item_to_insert
list_of_nums=eval(input())
insertion_sort(list_of_nums)
print(list_of_nums)
Result: Thus the program is written to perform selection sort and insertion sort using python programming.