Re: Re: faster sublist checking
- To: mathgroup at smc.vnet.net
- Subject: [mg48876] Re: [mg48874] Re: faster sublist checking
- From: Andrzej Kozlowski <akoz at mimuw.edu.pl>
- Date: Tue, 22 Jun 2004 05:31:11 -0400 (EDT)
- References: <cabq3o$oos$1@smc.vnet.net> <200406210749.DAA20975@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
On 21 Jun 2004, at 16:49, JMyers6761 wrote:
> Why is this?
>
> A = {3, 5}; B = {1, 2, 3, 4, 5, 6, 7};
>
> Intersection[B, A] == Sort[A]
> True
>
> but
>
> SublistQ[B_List, A_List] := Intersection[B, A] == Sort[A];
>
> SublistQ[B, A]
> False
>
> Al Myers
>
>
You don't need our help to answer this. Just quit the kernel and run
evaluate all the above again.
Andrzej Kozlowski
Chiba, Japan
http://www.mimuw.edu.pl/~akoz/
- References:
- Re: faster sublist checking
- From: jmyers6761@aol.com (JMyers6761)
- Re: faster sublist checking