Scribd
Upload
64 views5 pages

A Level Computer Science Paper 2 Tutorial - Bubble Sort Algorithms

This document provides an explanation of bubble sort, an algorithm for sorting a list of items. It describes the basic steps of bubble sort as repeatedly swapping adjacent elements that are in the wrong order until the list is fully sorted. The document includes 4 questions asking about analyzing the time complexity of bubble sort, pseudocode for implementing bubble sort, and ways to optimize bubble sort to improve its performance.

Uploaded by

Rajiv Beeharee
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
64 views5 pages

A Level Computer Science Paper 2 Tutorial - Bubble Sort Algorithms

This document provides an explanation of bubble sort, an algorithm for sorting a list of items. It describes the basic steps of bubble sort as repeatedly swapping adjacent elements that are in the wrong order until the list is fully sorted. The document includes 4 questions asking about analyzing the time complexity of bubble sort, pseudocode for implementing bubble sort, and ways to optimize bubble sort to improve its performance.

Uploaded by

Rajiv Beeharee
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/ 5

A Level Computer Science Paper 2 Tutorial – Bubble Sort

Question 1

A bubble sort algorithm is given as follows:

Rajiv Beeharee Page 1


Question 2

Rajiv Beeharee Page 2


Question 3

Rajiv Beeharee Page 3


Rajiv Beeharee Page 4
Question 4

Rajiv Beeharee Page 5

You might also like