14 - Final Test

array people[5] 
people = [“Imogen”, “Fletcher”, “Kirstie”, “Zoe”, “Gavin”]
found = False
x = 0
searchfor = input(“enter a name to search for : “)
while found = False AND x <5
	    if people[x] = searchfor then	        found = True
	        print “found at position” + x
	        x = x + 1
	    endif
Endwhile

01 p = input(“purchase price of car”		02 i = input(“number of improvements made”)
		03 a = input(“age of car in years”)
		04 s = p + (i*100)
		05 if a <= 10 then
		06     s = s + s
		07 endif
		08 print  “sale price is “ + s

2 p = input(“purchase price of car”		02 i = input(“number of improvements made”)
		03 a = input(“age of car in years”)
		04 s = p + (i*100)
		05 if a <= 10 then
		06     s = s + s
		07 endif
		08 print  “sale price is “ + s

3 p = input(“purchase price of car”		02 i = input(“number of improvements made”)
		03 a = input(“age of car in years”)
		04 s = p + (i*100)
		05 if a <= 10 then
		06     s = s + s
		07 endif
		08 print  “sale price is “ + s

For example, the Amazon website uses algorithms to decide the price of products. 
In 2011, the price of a book called 'The Making of a Fly' (about the molecular
 biology of a fly) jumped to £14 million
 as the pricing algorithms used by Amazon to set and update prices started outbidding 
each other. This raised the book price.

Complete the trace table for the following algorithm. 
Test it with a user input of 5.


1.	number <--USERINPUT
2.	FOR i <--- 1 TO 10
3.	    OUTPUT (number * i)


number	i	OUTPUT
======================
5	1	5
	?       ?
        ?       ?

def func1():
 global some_global #use global keyword
 my_global = 20

(10 >= 1) and (1 < 2)

>>> (1>2) and (9>=1)

limbs = 4
if limbs == 4:
 print('no one shall pass')
elif limbs > 0 <4:
 print('tis but a scratch')
else:

n = 0
for num in range(5):
 n = n + num
print (n)

while answer!=”computer”
 answer=input(“What is the
password?”)
endwhile
do
 answer=input(“What is the
password?”)
until answer == “computer”

def mergeSort(alist):

   print("Splitting ",alist)

   if len(alist)>1:
       mid = len(alist)//2
       lefthalf = alist[:mid]
       righthalf = alist[mid:]

       #recursion
       mergeSort(lefthalf)
       mergeSort(righthalf)

       i=0
       j=0
       k=0

       while i < len(lefthalf) and j < len(righthalf):
           if lefthalf[i] < righthalf[j]:
               alist[k]=lefthalf[i]
               i=i+1
           else:
               alist[k]=righthalf[j]
               j=j+1
           k=k+1

       while i < len(lefthalf):
           alist[k]=lefthalf[i]
           i=i+1

#demonstration of linear search

def linearsearch(x,mylist):
  found=False
  
  for i in range(len(mylist)):
    if x==mylist[i]:
      found=True
      break
    else:
      if x not in mylist:
        break

  if found==False:
     print("Not Found")
  else:
    print("Found in position",i)

     

mylist=[1,2,3,4,5]
x=int(input("Enter a number:"))
linearsearch(x,mylist)
  

23,42,4,16,8,15

23,42,4,16,8,15

23,42,4,16,8,15

def bubbleSort(arr):
    n = len(arr)
 
   
    for i in range(n):
 
        # Last i elements are already in place
        for j in range(0, n-i-1):
 
            # traverse the array from 0 to n-i-1
            # Swap if the element found is greater
            # than the next element
            if arr[j] > arr[j+1] :
                arr[j], arr[j+1] = arr[j+1], arr[j]

Enter www.facebook.com in your browser.  
facebook Home page loads  
Enter your Email ID and Password    
Is Email ID and Password Valid 
if NO then
Log in error  
go to step 3
else
Display facebook Account 
Stop

input b
x = 1
while x <=10 
print b * x
endwhile

input age
for x = 1 to age
print “happy birthday”
next x