linear vs binary search

Linear Search Vs Binary Search

Cont. learning Procedure (define and calling)
in class activity 28 October 2024

check discussion in managebac
for missing assignments​

Two things to do in Procedure

1. Define

2. Call

Using procedures in your programming is called modular programming.

The advantages of using procedures:
1. Program became short and easier to read
2. Procedures can be reused, so it is saving time

​

​Review: Procedure

Labelling

Matching the following programs

Drag labels to their correct position on the image

Conditional Loop

If Statement

Call Procedure

Define Procedure

List

Last week assignment
(Procedure)

If you submit only one file (Choice == C and Choice == D),
please submit the second one that using procedure (Choice == A for add_atom(), and Choice == B for remove_atom()), the instruction is in the task (click the slides link for name of the files)

1. Count through the list from the first

2. Compare each item to the search term

3. If there is a match, the item is in the list

Linear Search

1. Sort the list into order

2. Find the midpoint of the list

3. Compare the search term to the midpoint, is it higher or lower?

4. Keep splitting the list until it has only one

Binary Search

​Search Atom Finder

Linear Search (Operators)

The return operator command will stop the procedure and 'return' to the main program, example:
click the link to see sample code.

Return (operator)

The relational operator in compares a single value and a list, try the code below:
click the link then try in online-python program

in (operator):

​Review: Traverse a list (football team list)

Let's look at this table (for simple loop in python)

​len = length
index start from 0

Match

Match the following for linear search

• Store the input as a variable called 'name'

• Find the stop value (length of list)

• Use a for loop to count through the list one item at a time.

• An if statement. The logical test

• if the test is True, print a message

name = input("Enter a name:")

stop = len(atoms)

for i in range (stop):

if atoms[i] == name:

print (name, "found in list")

• name = input("Enter a name:")

• stop = len(atoms)

• for i in range (stop):

• if atoms[i] == name:

• print (name, "found in list")

​Let's try the code (linear search)

Click this link follow the instructions in google docs,
the file that you need to submit are .pdf(gdocs), and .py(python)
submit in managebac, total file needs to submit are 2 files

time: 15 Minutes
finish it together with your partner

Binary Search

1. ​Sort the list into order

2. Find the midpoint of the list

3. Compare the search term to the midpoint, is it higher or lower?

4. Keep splitting the list until it has only one

Binary Search

1. ​Sort the list into order

2. Find the midpoint of the list

3. Compare the search term to the midpoint, is it higher or lower?

4. Keep splitting the list until it has only one

Advantages and disadvantages

​Let's try the code (Binary search)

Click the link follow the instructions in google docs.
the file that you need to submit are .pdf(gdocs), and .py(python)
submit in managebac (2 files)
Total files submit in managebac are 4 files (2 python, 2 PDF gdocs = linear and binary search)

time: 15 Minutes
finish it together with your partner

Continue the project

​Progress submission (use procedure in your python project) then save and submit in managebac

Progress for this week and submission on November 4th, find the teacher then ask the approval for your project. The approval forms you can click this link after you got approval, you may begin to create your presentation.