Re: efficient comparison

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. :-)


SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
.

Relevant Pages

  • Re: for loop problem
    ... CBFalconer wrote: ... Unique in the sense that, while the extended ability may be copied, ... You all think I'm paranoid, ... #EOT ...
    (comp.lang.c)
  • 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)
  • Re: Float comparison
    ... CBFalconer writes: ... I know that you must keep some advices about comparing floating- ... points values for equality, but why I cannot use this method? ...
    (comp.lang.c)
  • Re: Copying from one struct to another, simple assignment?
    ... CBFalconer writes: ... Check the standard. ... Chapter and verse would be nice at this point. ... You all think I'm paranoid, ...
    (comp.lang.c)
  • Re: efficient comparison
    ... Willem wrote: ... way of comparing the sets? ... Chuck F (cbfalconer at maineline dot net) ...
    (comp.programming)