Best, Worst, Average Cases
{"Image DocumentName": "Best, Worst, Average Cases", "Image ImageDescription": "Sequential search for K in an array of n integers: Begin at first element in array and look at each element in turn until K is found. Best case: Worst case: Average case: Best: Find at first position. Cost is 1 compare. Worst: Find at last position. Cost is n compares. Average: (n+1)/2 compares IF we assume the element with value K is equally likely to be in any position in the array.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}