Scribd
Upload
112 views2 pages

Algo

The document contains 4 sections describing algorithms for Python programs to find the Fibonacci series, factorial of a number, binary search in a list, and linear search in a dictionary. Each section includes the aim, algorithm steps, and result of coding and running the program successfully.

Uploaded by

Atul Draws
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
112 views2 pages

Algo

The document contains 4 sections describing algorithms for Python programs to find the Fibonacci series, factorial of a number, binary search in a list, and linear search in a dictionary. Each section includes the aim, algorithm steps, and result of coding and running the program successfully.

Uploaded by

Atul Draws
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

--------------------------------------------------------

AIM
Write a python program to find the Fibonacci series

algo
1. Read n
2. Set fst = 0, sec = 1
3. Print fst, sec
4. for i in range 0 to n-2, loop:
4.1. set sum = fst + sec
4.2. set fst = sec, sec = sum
4.3. print sum

RESULT
The program was coded and run successfully
-----------------------------------------------------

AIM
Write a python program to find the factorial of a number using
function

algo
1. define function fact(n):
1.1. set p=1
1.2. for i in range 1 to n+1, loop:
1.2.1. set p=p*i
1.3. if n==0, then return 1
1.4. else return p
2. Read n
3. Call res=fact(n)
4. Print res

RESULT
The program was coded and run successfully

---------------------------------------------------------

AIM
Write a python program to implement binary search in a list

algo
1. define function binsearch (lis, val, beg, end):
1.1. set loc=0
1.2. while beg<=end, loop:
1.2.1. set mid = int((beg+end)//2)
1.2.2. if a[mid]<val, set beg=mid+1
1.2.3. else if a[mid]>val, set end=mid-1
1.2.4. else, return mid
1.3. return -1
2. Read list a
3. Set l = length of a
4. Sort list a
5. Read Enter value to be found
6. Call result= binsearch (a,value,0,l-1)
7. Print index position = result

RESULT
The program was coded and run successfully

----------------------

AIM
Write a python program to implement linear search in a
dictionary

algo
1. create dictionary dict = {}
2. Read elements of dict
3. Set l= length of dict

4. Read value to be found


5. for i in range 0 to l, loop
5.1. if dict[i] == val, then
5.1.1. print index position = i

RESULT
The program was coded and run successfully

You might also like