Re: efficient comparison

Willem wrote:
CBFalconer wrote:
) 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.

Of course, that says nothing about how efficient it is. :-)

Pascal is usually (depends on compiler) very efficient. The users
may not be so.

--
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: Question on while(!feof(fp))
    ... Willem wrote: ... Chuck F (cbfalconer at maineline dot net) ...
    (comp.lang.c)
  • Re: efficient comparison
    ... way of comparing the sets? ... Chuck F (cbfalconer at maineline dot net) ... Posted via a free Usenet account from http://www.teranews.com ...
    (comp.programming)
  • Re: study problems for binary trees??
    ... Willem wrote: ... > CBFalconer wrote: ... or even just ensure that all are consistent. ... >) anything fails it is not properly ordered. ...
    (comp.programming)
  • Re: study problems for binary trees??
    ... Willem wrote: ... > CBFalconer wrote: ... or even just ensure that all are consistent. ... >) anything fails it is not properly ordered. ...
    (alt.comp.lang.learn.c-cpp)
  • Re: efficient comparison
    ... CBFalconer writes: ... way of comparing the sets? ... Lots of languages have sets but Pascal's sets used to be so limited as ... to be almost useless of general versions of the above problem. ...
    (comp.programming)