Chapter 9: Enterprise Resource Planning1 Chapter 9: Enterprise Resource Planning.
Chapter 9
-
Upload
cara-cardenas -
Category
Documents
-
view
27 -
download
0
description
Transcript of Chapter 9
![Page 1: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/1.jpg)
Data Structures Using C++ 1
Chapter 9
Search Algorithms
![Page 2: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/2.jpg)
Data Structures Using C++ 2
Chapter Objectives
• Learn the various search algorithms• Explore how to implement the sequential
and binary search algorithms• Discover how the sequential and binary
search algorithms perform• Become aware of the lower bound on
comparison-based search algorithms• Learn about hashing
![Page 3: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/3.jpg)
Data Structures Using C++ 3
Sequential Search
template<class elemType>int arrayListType<elemType>::seqSearch(const elemType& item){ int loc; bool found = false; for(loc = 0; loc < length; loc++) if(list[loc] == item) { found = true; break; } if(found) return loc; else return -1;}//end seqSearch
What is the time complexity?
![Page 4: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/4.jpg)
Data Structures Using C++ 4
Search Algorithms
• Search item: target
• To determine the average number of comparisons in the successful case of the sequential search algorithm:– Consider all possible cases– Find the number of comparisons for each case– Add the number of comparisons and divide by
the number of cases
![Page 5: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/5.jpg)
Data Structures Using C++ 5
Search AlgorithmsSuppose that there are n elements in the list. The following expression gives the average number of comparisons, assuming that each element is equally likely to be sought:
It is known that
Therefore, the following expression gives the average number of comparisons made by the sequential search in the successful case:
![Page 6: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/6.jpg)
Data Structures Using C++ 6
Binary Search(assumes list is sorted)
![Page 7: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/7.jpg)
Data Structures Using C++ 7
Binary Search: middle element
first + last
2mid =
![Page 8: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/8.jpg)
Data Structures Using C++ 8
Binary Searchtemplate<class elemType>int orderedArrayListType<elemType>::binarySearch (const elemType& item){ int first = 0; int last = length - 1; int mid; bool found = false; while(first <= last && !found) { mid = (first + last) / 2; if(list[mid] == item) found = true; else if(list[mid] > item) last = mid - 1; else first = mid + 1; } if(found) return mid; else return –1;}//end binarySearch
![Page 9: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/9.jpg)
Data Structures Using C++ 9
Binary Search: Example
![Page 10: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/10.jpg)
Data Structures Using C++ 10
Binary Search: Example
• Unsuccessful search
• Total number of comparisons is 6
![Page 11: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/11.jpg)
Data Structures Using C++ 11
Performance of Binary Search
![Page 12: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/12.jpg)
Data Structures Using C++ 12
Performance of Binary Search
![Page 13: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/13.jpg)
Data Structures Using C++ 13
Performance of Binary Search
• Unsuccessful search– for a list of length n, a binary search makes
approximately 2 log2 (n + 1) key comparisons
• Successful search– for a list of length n, on average, a binary search makes
2 log2 n – 4 key comparisons
• Worst case upper bound: 2 + 2 log2 n
![Page 14: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/14.jpg)
Data Structures Using C++ 14
Search Algorithm Analysis Summary
![Page 15: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/15.jpg)
Data Structures Using C++ 15
Lower Bound on Comparison-Based Search
• Definition: A comparison-based search algorithm performs its search by repeatedly comparing the target element to the list elements.
• Theorem: Let L be a list of size n > 1. Suppose that the elements of L are sorted. If SRH(n) denotes the minimum number of comparisons needed, in the worst case, by using a comparison-based algorithm to recognize whether an element x is in L, then SRH(n) = log2 (n + 1).– If list not sorted, worst case is n comparisons
• Corollary: The binary search algorithm is the optimal worst-case algorithm for solving search problems by the comparison method (when the list is sorted).– For unsorted lists, sequential search is optimal
![Page 16: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/16.jpg)
Data Structures Using C++ 16
Hashing
• An alternative to comparison-based search
• Requires storing data in a special data structure, called a hash table
• Main objectives to choosing hash functions:– Choose a hash function that is easy to compute– Minimize the number of collisions
![Page 17: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/17.jpg)
Data Structures Using C++ 17
Commonly Used Hash Functions
• Mid-Square– Hash function, h, computed by squaring the identifier
– Using appropriate number of bits from the middle of the square to obtain the bucket address
– Middle bits of a square usually depend on all the characters, it is expected that different keys will yield different hash addresses with high probability, even if some of the characters are the same
![Page 18: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/18.jpg)
Data Structures Using C++ 18
Commonly Used Hash Functions
• Folding– Key X is partitioned into parts such that all the parts,
except possibly the last parts, are of equal length
– Parts then added, in convenient way, to obtain hash address
• Division (Modular arithmetic)– Key X is converted into an integer iX
– This integer divided by size of hash table to get remainder, giving address of X in HT
![Page 19: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/19.jpg)
Data Structures Using C++ 19
Commonly Used Hash Functions
Suppose that each key is a string. The following C++ function uses the division method to compute the address of the key:
int hashFunction(char *key, int keyLength)
{
int sum = 0;
for(int j = 0; j <= keyLength; j++)
sum = sum + static_cast<int>(key[j]);
return (sum % HTSize);
}//end hashFunction
![Page 20: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/20.jpg)
Data Structures Using C++ 20
Collision Resolution
• Algorithms to handle collisions
• Two categories of collision resolution techniques– Open addressing (closed hashing)– Chaining (open hashing)
![Page 21: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/21.jpg)
Data Structures Using C++ 21
Collision Resolution: Open Addressing
Pseudocode implementing linear probing:
hIndex = hashFunction(insertKey);found = false;while(HT[hIndex] != emptyKey && !found) if(HT[hIndex].key == key) found = true; else hIndex = (hIndex + 1) % HTSize;if(found) cerr<<”Duplicate items are not allowed.”<<endl;else HT[hIndex] = newItem;
![Page 22: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/22.jpg)
Data Structures Using C++ 22
Linear Probing
• 9 will be next location if h(x) = 6,7,8, or 9
Probability of 9 being next = 4/20, for 14, it’s 5/20, but only 1/20 for 0 or 1
Clustering
![Page 23: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/23.jpg)
Data Structures Using C++ 23
Random Probing
• Uses a random number generator to find the next available slot
• ith slot in the probe sequence is: (h(X) + ri) % HTSize where ri is the ith value in a random permutation of the numbers 1 to HTSize – 1
• All insertions and searches use the same sequence of random numbers
![Page 24: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/24.jpg)
Data Structures Using C++ 24
Quadratic Probing
• ith slot in the probe sequence is: (h(X) + i2) % HTSize (start i at 0)
• Reduces primary clustering of linear probing• We do not know if it probes all the positions in the
table• When HTSize is prime, quadratic probing probes
about half the table before repeating the probe sequence
![Page 25: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/25.jpg)
Data Structures Using C++ 25
Deletion: Open Addressing
• When deleting, need to remove the item from its spot, but cannot reset it to empty (Why?)
![Page 26: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/26.jpg)
Data Structures Using C++ 26
Deletion: Open Addressing
• IndexStatusList[i] set to –1 to mark item i as deleted
![Page 27: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/27.jpg)
Data Structures Using C++ 27
Collision Resolution: Chaining (Open Hashing)
• No probing needed; instead put linked list at each hash position
![Page 28: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/28.jpg)
Data Structures Using C++ 28
Hashing Analysis
Let
Then a is called the load factor
![Page 29: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/29.jpg)
Data Structures Using C++ 29
Average Number of Comparisons• Linear probing:
• Successful search:
• Unsuccessful search:
• Quadratic probing:
• Successful search:
• Unsuccessful search:
![Page 30: Chapter 9](https://reader036.fdocuments.in/reader036/viewer/2022081513/56812ec9550346895d9468ee/html5/thumbnails/30.jpg)
Data Structures Using C++ 30
Chaining: Average Number of Comparisons
1. Successful search
2. Unsuccessful search