Re: efficient comparison

bob@xxxxxxxxxxxxxx wrote:

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.

Use Pascal, and then those are all primitive operations. I kid you
not.

--
Chuck F (cbfalconer at maineline dot net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net>


--
Posted via a free Usenet account from http://www.teranews.com

.

Relevant Pages

  • Re: Pi program and hard disk usage
    ... Chuck F (cbfalconer at maineline dot net) ... Posted via a free Usenet account from http://www.teranews.com ...
    (comp.programming)
  • Re: Towards a GREP Utility for WS4 Files
    ... Chuck F (cbfalconer at maineline dot net) ... Try the download section. ... Posted via a free Usenet account from http://www.teranews.com ...
    (comp.os.cpm)
  • Re: comparison
    ... Chuck F (cbfalconer at maineline dot net) ... Posted via a free Usenet account from http://www.teranews.com ...
    (comp.lang.c)
  • Re: Is i = i++; bad style?
    ... Is Xananews the same thing as Xnews, perchance? ... cbfalconer at maineline dot net ... Posted via a free Usenet account from http://www.teranews.com ...
    (comp.lang.c)
  • Re: Bad sectors on /dev/hda
    ... drive in the most painless manner. ... cbfalconer at maineline dot net ... Posted via a free Usenet account from http://www.teranews.com ...
    (comp.os.linux.misc)