CS 1301 Recitation 8 10_13

CS 1301 Recitation 8 10_13 - Linear search >>> a =...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Bubble sort Selection sort goes down the list and finds the smallest number and bring it to the front. Quick Sort picks a pivot and puts all the numbers smaller than the pivot on the left and all the numbers greater than the pivot on the right. Then it keeps on picking a pivot as the first number on that side of the pivot and compares it to the number after it and sorts it that way. Binary search
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Linear search >>> a = [1, 2, 3, [4, 5]] >>> a[3][0] 4 >>> a = [[[[1]]]] >>> a[0] [[[1]]] >>> a[0][0][0][0] 1 >>> a = [1, 2, 3, [4, 5]] >>> len(a) 4 >>> isinstance([2,3],list) True >>> def averageRows(matrix): for oneMatrix in matrix: for numbers in oneMatrix: average = float(sum(matrix(oneMatrix[numbers]))/len(matrix(oneMatrix[numbers])) oneMatrix.append(average) return matrix...
View Full Document

This note was uploaded on 02/16/2012 for the course CS 1301 taught by Professor Staff during the Fall '08 term at Georgia Institute of Technology.

Ask a homework question - tutors are online