Linear Search & Bubble Sort (Cambridge (CIE) IGCSE Computer Science)

1

Check the first value

2

IF it is the value you are looking for

• STOP!

3

ELSE move to the next value and check

4

REPEAT UNTIL you have checked all values and not found the value you are looking for

# Identify the dataset, target value, and set the initial flag
DECLARE data : ARRAY[1:5] OF INTEGER 
DECLARE target : INTEGER 
DECLARE found : BOOLEAN 

data ← [5, 2, 8, 1, 9]
target ← 11
found ← FALSE

# Loop through each element in the data
FOR index ← 1 TO 5 DO
    IF data[index] = target THEN
        # If found, output message
        found ← TRUE
        OUTPUT "Target found"
        BREAK
    ENDIF
NEXT index

# If the target is not found, output a message
IF found = FALSE THEN
    OUTPUT "Target not found"
ENDIF

# Identify the dataset to search, the target value and set the initial flag
data = [5, 2, 8, 1, 9]
target = 11
found = False

# Loop through each element in the data
for index in range(0, len(data)):  # loop to go through all elements
    # Check if the current element matches the target
    if data[index] == target:
        # If found, output message
        found = True
        print("Target found")
        break  # Exit the loop if the target is found

# If the target is not found, output a message
if not found:
    print("Target not found")

1

Compare the first two values in the dataset

2

IF they are in the wrong order...

• Swap them

3

Compare the next two values

4

REPEAT step 2 & 3 until you reach the end of the dataset (pass 1)

5

IF you have made any swaps...

• REPEAT from the start (pass 2,3,4...)

6

ELSE you have not made any swaps...

• STOP! the list is in the correct order

1

Compare the first two values in the dataset

2

IF they are in the wrong order...

• Swap them

3

Compare the next two values

4

REPEAT step 2 & 3 until you reach the end of the dataset

• 5 & 4 SWAP!

• 5 & 1 SWAP!

• 5 & 6 NO SWAP!

• 6 & 3 SWAP!

• End of pass 1

5

IF you have made any swaps...

• REPEAT from the start

• End of pass 2 (swaps made)

• End of pass 3 (swaps made)

• End of pass 4 (no swaps)

6

ELSE you have not made any swaps...

• STOP! the list is in the correct order

# Unsorted dataset
DECLARE nums : ARRAY[1:11] OF INTEGER 
nums ← [66, 7, 69, 50, 42, 80, 71, 321, 67, 8, 39]

# Count the length of the dataset
DECLARE numlength : INTEGER 
numlength ← 11

# Set a flag to initiate the loop
DECLARE swaps : BOOLEAN 
swaps ← TRUE

WHILE swaps DO  # While any swap is made, continue
    swaps ← FALSE
    # Loop through the dataset
    FOR y ← 1 TO numlength - 1 DO
        IF nums[y] > nums[y + 1] THEN  # If the first number is bigger
            # Swap the numbers
            DECLARE temp : INTEGER 
            temp ← nums[y]
            nums[y] ← nums[y + 1]
            nums[y + 1] ← temp
            swaps ← TRUE  # Mark that a swap was made
        ENDIF
    NEXT y
    # Each iteration confirms that the last element is in place
    numlength ← numlength - 1
ENDWHILE

# Print the sorted list
OUTPUT nums

# Unsorted dataset
nums = [66, 7, 69, 50, 42, 80, 71, 321, 67, 8, 39]

# Count the length of the dataset
numlength = len(nums)

# Set a flag to initiate the loop
swaps = True

while swaps:  # While any swap is made, continue
    swaps = False
    # Loop through the dataset
    for y in range(numlength - 1):  # Compare adjacent elements
        if nums[y] > nums[y + 1]:  # If the first number is bigger
            # Swap the numbers using a temporary variable
            nums[y], nums[y + 1] = nums[y + 1], nums[y]
            swaps = True  # Mark that a swap was made

    # Each iteration confirms that the last element is in place
    numlength -= 1

# Print the sorted list
print(nums)