Re: faster sublist checking
- To: mathgroup at smc.vnet.net
- Subject: [mg48887] Re: faster sublist checking
- From: drbob at bigfoot.com (Bobby R. Treat)
- Date: Tue, 22 Jun 2004 05:31:30 -0400 (EDT)
- References: <cabq3o$oos$1@smc.vnet.net> <cb645s$khh$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Both evaluate to True at my machine (Mathematica 5.0.1).
Bobby
jmyers6761 at aol.com (JMyers6761) wrote in message news:<cb645s$khh$1 at smc.vnet.net>...
> 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