Python code for  Sorting of numbers in Increasing Order ( by selection sort ):

 



list=dict()
count=int(input('enter the number of total values in list'));

for i in range (0,count):
        list[i]=int(input('enter the value'));
       
print ('the entered unsorted list is as follows');
print dict.values(list)

k=1;
for j in range(0,count-1):  
   
    for k in range(j+1,count):
       
        if list[k]<list[j]:
            exchange=list[j]
            list[j]=list[k];
            list[k]=exchange;


print dict.values(list)
          

 This is a PYTHON  2.x program to calculate the prime factors of the positive integer:




number=int(input('enter the number to be factorized'));
print ('the entered number was %d'%number);
divisor=2;
import math

i=0;
factors=dict({});
while number%2==0:
    nwnumber=number/divisor;
    factors[i]=divisor;
    number=nwnumber;
  
    i=i+1;
    if number==0:
         break;

divisor=3;
nwnumber=number;

while number!=1:
           

        if nwnumber%divisor==0 :
            factors[i]=divisor;
            nwnumber=nwnumber/divisor;
            i=i+1
            continue;
        elif nwnumber==1:
             break;          

        elif math.sqrt(nwnumber)>divisor:        
            divisor=divisor+2  
            i=i+1
        else:
            i=i+1;
            factors[i]=nwnumber;
            break;
      
print ('the prime factors of the entered number are :');
print dict.values(factors)