Re: A fast way to compare two vectors

*To*: mathgroup at smc.vnet.net*Subject*: [mg121683] Re: A fast way to compare two vectors*From*: Yasha Gindikin <gindikin at gmail.com>*Date*: Mon, 26 Sep 2011 04:12:49 -0400 (EDT)*Delivered-to*: l-mathgroup@mail-archive0.wolfram.com*References*: <j5m44t$ple$1@smc.vnet.net> <j5mt8t$sn8$1@smc.vnet.net>*Reply-to*: comp.soft-sys.math.mathematica at googlegroups.com

Alas, there was a misprint in my code, I'm terribly sorry about that. The length of the intersection R should be >=n-2, where n is the length of the vector a[[p]]. Thank you so much for your realization of the poscom function, I'll explore the performance gain and report here.:)