Scribd
Upload
7 views

Python Programs

python programs

Uploaded by

Minni Mca
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Python Programs

python programs

Uploaded by

Minni Mca
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#pyramid formation

i=1
while (i<=6):
for j in range(1,i):
print(j,end = '\t')
print(end = '\n')
i=i+1

OUTPUT
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5

#LARGEST OF THREE NUMBERS


a=int(input('enter a'))
b=int(input('enter b'))
c=int(input('enter c'))
if (a>b) and (a>c) :
large = a
elif (b>a) and (b>c) :
large = b
else :
large = c
print('larges number is ' , large)

#Palindrome
st = input('Enter a String')
if (st == st[ : :-1]) :
print('Palindrome')
else :
print('Not a Palindrome')

#prime number
n = int(input('enter any number'))
flag = 0
for i in range(2,n):
if (n%i) == 0 :
flag = 1
break
if flag == 0 :
print(n ,'is prime number')
else :
print(n ,'is not a prime number')

#reversing the digits


n = int(input("enter any number"))
while n != 0:
d=n%10
n=n//10
print(d,end=' ')
#sum of the digits
n = int(input("enter any number"))
s=0
while n != 0:
d=n%10
n=n//10
s = s+d
print(s)

#sum of all positive numbers in a list


n = [1,3,2,-3,6,-4,9,0,-4]
s=0
for i in n:
if i > 0 :
s = s +i
print('sum of +ve nos = ', s)

#sum of all numbers until a negative number arrives


n = [1,3,2,-3,6,-4,9,0,-4]
s=0
for i in n:
if i > 0 :
s = s +i
else:
break
print('sum of +ve nos = ', s)

# prime number using functions


def prime(n):
flag = 0
for i in range(2,n):
if (n%i) == 0 :
flag = 1
break
return(flag)
number = int(input('enter any number'))
p = prime(number)
if p :
print(number ,'is not a prime number')
else :
print(number ,'is a prime number')

#factorial using functions


def fact(n):
f=1
for i in range(1,n+1):
f = f* i
return(f)
number = int(input("enter number"))
ft = fact(number)
print('factorial of ',number ,'=',ft)

#linear search
list = [2,5,3,9,7]
x= int(input('enter element to be searched'))
n = len(list)
flag=0
for i in range(0,n):
if list[i] == x:
flag=1
break
if flag :
print("element found at position",i)
else:
print("element not found")

#binary search
array = [2,5,7,9,12]
x= int(input('enter element to be searched'))
n = len(list)
flag=0
low =0
high = len(list)-1
while low <= high:
mid = (low + high)//2
if array[mid] == x:
pos= mid
flag=1
break
elif array[mid] < x:
low = mid + 1
else:
high = mid - 1
if flag:
print("element found at position",pos)
else:
print("element not found")

You might also like