Chapter 9: More Python

Question 1

Bubble Sort

Answer 1

Iterates through a list examining pairs of items at a time

Question 2

Selection Sort

Answer 2

It works by finding the smallest item in a list and then placing it in the first position. It then finds the next smallest item and places it in second position.

Question 3

Insertion Sort

Answer 3

It works by iterating through the sorted items in a list to determine the correct location at which to insert each new item.

Question 4

What is the advantages of functions?

Answer 4

Hide the complexity of the code

Easy to understand

Question 5

Recursion

Answer 5

breaking a problem down into subsets of the same problem

Question 6

Cons of recursion

Answer 6

doesnt scale up like iteration
iterative solutions are mostly faster
more abstract
harder to understand than iterative solutions

Question 7

Pros of recursion

Answer 7

fast and easy to code

practical for tree traversal and binary search

Question 8

Advantages of Linear Search

Answer 8

It is quick and more efficient for smaller and unsorted data

Question 9

Binary Search

Answer 9

It is referred to as the divide and conquer algorithm as when using binary search we compare the value to half the list to see if it is there and we keep halving and halving (comparing as well) until we find it.

Question 10

Linear search

Answer 10

It is a search algorithm that iterates through each item in a list one at a time comparing it to a key
(Used to sort list and arrays
Only option for unsorted data)

Question 11

Quick sort

Answer 11

Implement recursively.

The sorting algorithm is recursively repeated on subsets of the same problem until a specific stopping point is reached

Question 12

Unit

Answer 12

smallest component of a program that can be tested

Question 13

Advantages of Unit Testing

Answer 13

Fast
Allows bugs to be easily identified
Makes easy for others to check
Provides documentation