O Analysis of Methods and Data Structures.pptVIP

O Analysis of Methods and Data Structures Reasonable vs. UnreasonableAlgorithms Using O Analysis in Design Now Available Online! O Analysis of Methods and Data Structures The Scenario We’ve talked about data structures and methods to act on these structures… Linked lists, arrays, trees Inserting, Deleting, Searching, Traversal, Sorting, etc. Now that we know about O notation, let’s discuss how each of these methods perform on these data structures! Recipe for Determining O Break algorithm down into “known” pieces We’ll learn the Big-Os in this section Identify relationships between pieces Sequential is additive Nested loop / recursion is multiplicative Drop constants Keep only dominant factor for each variable Array Size and Complexity How can an array change in size? MAX is 30 ArrayType definesa array[1..MAX] of Num We need to know what N is in advance to declare an array, but for analysis of complexity, we can still use N as a variable for input size. Traversals Traversals involve visiting every element in a collection. Because we must visit every node, a traversal must be O N for any data structure. If we visit less than N elements, then it is not a traversal. Comparing Data Structures and Methods Data Structure Traverse Unsorted L List N Sorted L List N Unsorted Array N Sorted Array N Binary Tree N BST N FB BST N Searching for an Element Searching involves determining if an element is a member of the collection. Simple/Linear Search: If there is no ordering in the data structure If the ordering is not applicable Binary Search: If the data is ordered or sorted Requires non-linear access to the elements Simple Search Worst case: the element to be found is the Nth element examined. Simple search must be used for: Sorted or unsorted linked lists Unsorted array Binary tree Binary Search Tree if it is not full and balanced Comparing Data Structures and Methods Data Structure Traverse Search Unsorted L List N N Sorted L List N N U