Re: efficient comparison

<bob@xxxxxxxxxxxxxx> wrote in message
news:1188266948.054544.252730@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
Let's say you have a set of names called set A. You also have a
different
set of names called set B. What is the most efficient way of
comparing the sets?

By comparison, I mean finding the names that need to be added to set B
and
deleted from set B to form set A.

It seems like a simple sort of each list then going through and comparing.
Rather trivial actually.


.