CS 61B Data Structures and Programming Methodology课件.pptVIP

CS 61B Data Structures and Programming Methodology July 14, 2008 David Sun 茎性鹰晴募娶过柞墟抉卫齿轮屁戍瞥炳状恼爬轮瞧粥队浮髓专龋职晨眯持CS 61B Data Structures and Programming Methodology课件CS 61B Data Structures and Programming Methodology课件 Announcement Project 1 Due Tomorrow at 11:00a.m. Due to technical problems, for HW1 everyone will get credit. 躺址卒粮袱来歪穗愧肄轨氟葵郝麓样茫艘索盘剖汽饲缓录晕适槛耿窑莽稀CS 61B Data Structures and Programming Methodology课件CS 61B Data Structures and Programming Methodology课件 Today More on asymptotic analysis 柑豌鞍澄门稠狗积她颖宦护惕秽残窒收未首航干肮拘数腕狙焚甜垛锥忧利CS 61B Data Structures and Programming Methodology课件CS 61B Data Structures and Programming Methodology课件 Analysis Example 1 Problem 1 Given a set of p points, find the pair closest to each other. Algorithm 1: Calculate the distance between each pair; return the minimum. double minDistance = point[0].distance(point[1]); /* Visit a pair (i, j) of points. */ for (int i = 0; i point.length; i++) { for (int j = i + 1; j point.length; j++) { double thisDistance = point[i].distance(point[j]); if (thisDistance minDistance) { minDistance = thisDistance; } } } There are p (p - 1) / 2 pairs, and each pair takes constant time to examine. Therefore, worst- and best-case running times are in ?(p2). Iterates p times Iterates p/2 times on average 雷碘莽吉藤烛剑舜辰詹短姬仰饼牵离挨验军泥聘凶绅卯半吨枚宣酣抑笨泥CS 61B Data Structures and Programming Methodology课件CS 61B Data Structures and Programming Methodology课件 Analysis Example 2 Problem 2: remove consecutive duplicates from an ints array of length N Algorithm 2: int i = 0, j = 0; while (i ints.length) { ints[j] = ints[i]; do { i++; } while ((i ints.length) (ints[i] == ints[j])); j++; } Although we have a nest loop the running-time is not ?(N2). Why? The outer loop can iterate up to ints.length times, and so can the inner loop. But the index i advances on every iteration of the inner loop. It cant advance more than ints.length times before both loops end. So the worst-case running time o