First N prime Numbers Word Count

n = int(input('Enter n value')) import sys

count=0 if len(sys.argv)!=2:
num=2 print("Error : Filename missing")
sys.exit(1)
while count!=n:
flag=0 filename = sys.argv[1]
for i in range(2,num):
if num%i==0: file = open(filename,"r+")
flag=1 wordcount = {}
break
if flag==0: for word in file.read().split():
print(num) if word not in wordcount:
count=count+1 wordcount[word] = 1
num=num+1 else:
wordcount[word] += 1

for k,v in wordcount.items():

print(k,v)

Selection Sort Insertion Sort

a=[]
n = int(input('Enter the size of list:'))
for i in range(1,n+1):
z = int(input('Enter Element:'))
a.append(z)
a=[]
n = int(input('Enter the size of list:'))
for i in range(1,n+1):
z = int(input('Enter Element:'))
a.append(z)

for i in range(0,len(a)): for i in range(1,len(a)):

pos=i temp = a[i]
for j in range(i+1,len(a)): j = i-1
if a[j]<a[pos]: while j>=0 and a[j]>temp:
pos= j a[j+1] = a[j]
temp = a[i] j = j-1
a[i] = a[pos] a[j+1] = temp
a[pos] = temp
print(a)
print(a)