Re: faster sublist checking
- To: mathgroup at smc.vnet.net
- Subject: [mg48874] Re: faster sublist checking
- From: jmyers6761 at aol.com (JMyers6761)
- Date: Mon, 21 Jun 2004 03:49:05 -0400 (EDT)
- References: <cabq3o$oos$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
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
- Follow-Ups:
- Re: Re: faster sublist checking
- From: Andrzej Kozlowski <akoz@mimuw.edu.pl>
- Re: Re: faster sublist checking