algorithms

Question 1

2 things to check when developing an algorithm

Answer 1

time complexity
space complexity

Question 2

what is time complexity

Answer 2

how much it takes to solve a particular problem

Question 3

what is time complexity measured in

Answer 3

using big-o notation

Question 4

what does big o notation show

Answer 4

the effectiveness of an algorithm
show the time taken relative to the number of data elements given as an input

Question 5

what is the benefit of big O notation

Answer 5

allows to predict the amount of time it takes for an algorithm to finish the given number of elements

Question 6

define liner search algorithm

Answer 6

an algorithm that looks through every item one at a time until it finds the item its searching for

Question 7

big o notation for linear search algorithm is

Answer 7

0 (n)

Question 8

what is binary search algorithm

Answer 8

a divide and conquer algorithm, this means it splits the list into smaller lists until it finds the item its searching for

Question 9

big o notation for binary search

Answer 9

0 ((log(n)

Question 10

what is a bubble sort algorithm

Answer 10

Algorithm that passes through the list evaluating pairs of items and ensuring the larger value is above the smaller value

Question 11

big o notation for bubble sort 0(n^2)

Answer 11

0(n^2)

Question 12

big o notation for bubble sort 0(n^2)

Answer 12

0(n^2)

Question 13

what is an algorithm,

Answer 13

a series of steps taken to complete a task

Question 14

what is space complexity

Answer 14

the space complicity of an algorithm is the amount oof storage the algorithm takes (keep in sotairage is expensive )

Question 15

big o notation for space complexity

Answer 15

(O(n))

Question 16

In maths and Physics tutor look at BIG ON NOTAION DEFINITIOSN AND GRAPHS

Question 17

what does bubble sort do

Answer 17

makes ​comparisons and swaps ​between pairs of elements

Question 18

how does bubble sorting work

Answer 18

he algorithm starts at the first element in an array and compares it to the second. If they are in the wrong order, the algorithm ​swaps ​the pair. Otherwise, the algorithm moves on. other wise repeats process

Question 19

important note in bubble sort

Answer 19

one pass= the whole line being sorted I ascending order even if the first element aren’t correct
e.g the 1st pass may look like this
4,1,6,7,9
2nd pass= bubble sort reorder again from the beginning
e.g 1,4,6,7,9

Question 20

pseudocode for bubble sort

Answer 20

A = A​rray of data
for i = 0 to A.length - 1:
noSwap = True forj=0toA.length-(​j+2)​:
if A[j] > A[j+1]:
temp = A[j]
A[j] = A[j+1]
A[j+1] = temp
noSwap = False
if noSwap:
break
return A

Question 21

is bubble sort a fast algorithm

Answer 21

slow

Question 22

what is insertion sort

Answer 22

insertion sort ​places elements into a sorted sequence​.

Question 23

where does insertion sort start

Answer 23

rt ​starts at the second element ​in the input, and compares it to the element ​to its left​. If the two elements are in the wrong order, the smaller element is placed in the lowest position.

Question 24

things to note about insertion sort

Answer 24

if you have gotten to the 6 element of the list and it is smaller than all the first ones (although it has already. been sorted) it automatically goes to its correct position

Question 25

speudocode for insertion sort

Answer 25

A = A​rray of data
for i = 1 to A.length - 1:
elem = A[i]
j=i- 1
while j > 0 and A[j] > elem:
A[j+1] = A[j]
j = j -1 A[j+1] = elem

Question 26

pseudocode in bubble sort

Answer 26

n= items.Length
swapped = True
while n > 0 AND swapped
swapped = False
n = n - 1
For index = 0 TO n - 1
IF items [index] > items [index+1] then
Swap (items[index], items[index+1])
swapped = True
End If
End For
End while

Question 26

pseudocode in bubble sort

Answer 26

n= items.Length
swapped = True
while n > 0 AND swapped
swapped = False
n = n - 1
For index = 0 TO n - 1
IF items [index] > items [index+1] then
Swap (items[index], items[index+1])
swapped = True
End If
End For
End while

Question 27

bubble;e sort code in python

Answer 27

n=len (items)
swapped = true

while n > 0 and swapped ==true:
swapped = False
n=n-1
for index in range (0,n)
if items [index] > items [index+1]
temp = items [index]
items [index] = items [index+1]
items [index+1] = temp
swapped=true