what is selection sort:-
In selection sort we repeatedly find the minimum element from unsorted part and putting it at the beginning. In this we have two subarray sorted and unsorted subarray .
In every cycle we find the minimum from the unsorted subarray and moved it to the sorted subarray .
Code:-
print("Enter the list numbers")
mylist=list(map(int,input().split()))
# logic for the selection sort
l=len(mylist)
for i in range(l):
min=mylist[i]
for j in range(i+1,l):
if min>mylist[j]:
temp=min
min=mylist[j]
mylist[j]=temp
mylist[i]=min
print("Sorted list is : ")
print(mylist)
Output:-
Enter the list numbers
34 2 54 6 78
Sorted list is :
[2, 6, 34, 54, 78]
Recommended Post:-
- Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-Data structure:-- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments