Having trouble figuring this out. If I have 2 sets of integers how would I use a hash table to test if set A is a subset of set B (in pseudocode). I think I understand that basically I would need to create a hash table for all the elements of B. Then, the traverse A and search for each element in the hash table. If the element is not found return 0. If all elements are found return 1 (meaning A is a subset of B).
Also, I believe the average run time and worst case run time would be the same in this scenario,,, O(n+m)
Further than that though, I am having trouble creating an algorithm (pseudocode) for this problem. Any help would be appreciated. Thanks