Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2004
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

RE: faster sublist checking

  • To: mathgroup at smc.vnet.net
  • Subject: [mg48675] RE: [mg48640] faster sublist checking
  • From: "Ellis, George" <George.Ellis at Cognos.COM>
  • Date: Thu, 10 Jun 2004 02:43:16 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com
  • Thread-topic: [mg48640] faster sublist checking

Giorgio,

I would suggest:

a = Range[3, 5];
b = Range[1, 10];
Intersection[a, b] == a

Unless I misunderstand what you want?

Regards,

George 

-----Original Message-----
From: giorgio borghi [mailto:gimbo20032003 at libero.it] 
To: mathgroup at smc.vnet.net
Subject: [mg48675] [mg48640] faster sublist checking

which is the faster implementantion of function that checks if a list A
is a sublist of B. es:  A={3,4,5} B={1,2,3,4,5,6,7} gives True? 
  
       This message may contain privileged and/or confidential information.  If you have received this e-mail in error or are not the intended recipient, you may not use, copy, disseminate or distribute it; do not open any attachments, delete it immediately from your system and notify the sender promptly by e-mail that you have done so.  Thank you. 
 


  • Prev by Date: Interpolating function
  • Next by Date: Re: transforming exponential of sums into product of exponentials
  • Previous by thread: Re: faster sublist checking
  • Next by thread: Re: faster sublist checking