Presentation is loading. Please wait.

Presentation is loading. Please wait.

Searching.

Similar presentations


Presentation on theme: "Searching."— Presentation transcript:

1 Searching

2 Linear Search Given a list of data, find the location of a particular value or report that value is not present Linear search intuitive approach: start at first item is it the one I am looking for? If not, go to next item repeat until found or all items checked If items not sorted or unsortable this approach is necessary CS Data Structures

3 Linear Search Code /* return the index of the first occurrence
of target in list, or -1 if target not present in list */ public int linearSearch(int list[], int target) { int i = 0; while(i < list.length && list[i] != target) i++; if(i >= list.length) return -1; else return i; } CS Data Structures

4 Question 1 What is the average case Big-O of linear search in an array with n items, if an item is present? O(n) O(n2) O(1) O(log(n)) O(n log(n)) CS Data Structures

5 Question 1 What is the average case Big-O of linear search in an array with n items, if an item is present? O(n) O(n2) O(1) O(log(n)) O(n log(n)) CS Data Structures

6 Searching in a Sorted List
If items are sorted, we can divide and conquer Dividing your work in half with each step Generally a good thing The Binary Search on list in ascending order start at middle of list is that the item? if not, is it less than or greater than the item? less than, move to second half of list greater than, move to first half of list repeat until found or sub-list size = 0 CS Data Structures

7 Binary Search list Is middle item what we are looking for?
low item middle item high item Is middle item what we are looking for? If not, is it more or less than the target? If lower… list low middle high item item item and so forth… CS Data Structures

8 Recursive Binary Search
public static int search(int list[], int target) { return b-search(list, target, 0, list.length – 1); } public static int b-search(int list[], int target, int low, int high) { if( low <= high ) int mid = low + ((high - low) / 2); if( list[mid] == target ) return mid; else if( list[mid] > target ) return b-search(list, target, low, mid – 1); else return b-search(list, target, mid + 1, high); return -1; CS Data Structures

9 Question 2 What is the worst case Big O of binary search in an array with n items, if an item is present? O(n) O(n2) O(1) O(log(n)) O(n log(n)) CS Data Structures

10 Question 2 What is the worst case Big O of binary search in an array with n items, if an item is present? O(n) O(n2) O(1) O(log(n)) O(n log(n)) CS Data Structures

11 Other Searching Algorithms
Interpolation Search more like what people really do Binary Search Trees Hash Table Searching Best-First A* Interpolation Search: Interpolation search is an algorithm for searching for a given key in an indexed array that has been ordered by numerical values assigned to the keys (key values). It parallels how humans search through a telephone book for a particular name, the key value by which the book's entries are ordered. In each search step it calculates where in the remaining search space the sought item might be, based on the key values at the bounds of the search space and the value of the sought key, usually via a linear interpolation. The key value actually found at this estimated position is then compared to the key value being sought. If it is not equal, then depending on the comparison, the remaining search space is reduced to the part before or after the estimated position. This method will only work if calculations on the size of differences between key values are sensible. [Wikipedia] Binary Search Trees: Binary search trees keep their keys in sorted order, so that lookup and other operations can use the principle of binary search: when looking for a key in a tree (or a place to insert a new key), they traverse the tree from root to leaf, making comparisons to keys stored in the nodes of the tree and deciding, based on the comparison, to continue searching in the left or right subtrees. On average, this means that each comparison allows the operations to skip about half of the tree, so that each lookup, insertion or deletion takes time proportional to the logarithm of the number of items stored in the tree. This is much better than the linear time required to find items by key in an (unsorted) array, but slower than the corresponding operations on hash tables. [Wikipedia] Hash Tables: Hash table (hash map) is a data structure, which implements an associative array abstract data type, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots, from which the desired value can be found. Ideally, the hash function will assign each key to a unique bucket, but most hash table designs employ an imperfect hash function, which might cause hash collisions, where the hash function generates the same index for more than one key. Such collisions must be accommodated in some way. In a well-dimensioned hash table, the average cost for each lookup is independent of the number of elements stored in the table. [Wikipedia] Best-First: Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule. [Wikipedia] A*: A* (pronounced as "A star") is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently directed path between multiple points, called nodes. It enjoys widespread use due to its performance and accuracy. However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance, although other work has found A* to be superior to other approaches. [Wikipedia] CS Data Structures

12 CS Data Structures


Download ppt "Searching."

Similar presentations


Ads by Google