Efficient way to find the difference between two data sets
问题 I have two copies of data, here 1 represents my volumes and 2 represent my issues. I have to compare COPY2 with COPY1 and find all the elements which are missing in COPY2 ( COPY1 will always be a superset and COPY2 can be equal or will always be a subset). Now, I have to get the missing volume and the issue in COPY2. Such that from the following figure(scenario) I get the result as : - Missing files – 1-C, 1-D, 2-C, 2-C, 3-A, 3-B, 4,E. Question- What data structure should I use to store the