#Selection Sort
def func_min(new_list):
min=new_list[0]
for i in range(1,len(new_list)):
if(new_list[i]<min):
min=new_list[i]
return (min)
def selection_sort(org_list):
sorted_list = []
while(len(org_list)):
sorted_list.append(func_min(org_list))
org_list.remove(func_min(org_list))
return sorted_list
array = [20, 21, 23, 35 ,22, 19, 18, -3 ,14, 4]
print(array)
s_array = selection_sort(array)
print(s_array)
# Creating a dictionary and sends its keys to Set A or Set B
def mod_nm(number,divider):
while(number>=divider):
number-=divider
return number
def is_prime(num):
i=2
while(i<=num/2):
if(mod_nm(num,i)==0):
return 0
else:
i=i+1
return 1
def prime_set(dict_p):
for e_key in dict_p.keys():
if(is_prime(dict_p[e_key])):
set_B.add(e_key)
else:
set_A.add(e_key)
set_A = set([])
set_B = set([])
new_dict={}
new_dict[1]= 17
new_dict[2]= 29
new_dict[3]= 38
new_dict[4]= 49
new_dict[5]= 125
new_dict[6]= 37
new_dict[7]= 53
new_dict[8]= 86
new_dict[9]= 93
prime_set(new_dict)
print(new_dict)
print(set_A)
print(set_B)
# Finding a set including elements that appear more than once in a list
def more_than_once(original_list):
unique_set = set(original_list)
for item in unique_set:
original_list.remove(item)
return set(original_list)
list_new = [1, 5 ,3, 2, 5 , 4 , 7 , 8 , 3, 1, 1]
print(list_new)
set_new = more_than_once(list_new)
print(set_new)
#Function that reverse a list
def reverse_list(original_list):
reversed_list = []
for i in range(len(original_list)-1,-1,-1):
reversed_list.append(original_list[i])
return reversed_list
new_list = [5,3,9,7,13,136,45,22]
print(reverse_list(new_list))
print(new_list)