Date: Fri, 23 Apr 2010 18:18:46 +0300 From: Eitan Adler <eitanadlerlist@gmail.com> To: Leinier Cruz Salfran <salfrancl.listas@gmail.com> Cc: freebsd-hackers <freebsd-hackers@freebsd.org> Subject: Re: c question Message-ID: <i2za0777e081004230818y9008c7b7yc574298df85933dc@mail.gmail.com> In-Reply-To: <l2ga2585ef1004090709u821fc979i226a3125d9da8251@mail.gmail.com> References: <l2ga2585ef1004090709u821fc979i226a3125d9da8251@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
> - use a matrix is faster than use a linked list? For what? For insertion and deletion no - linked list is faster. For sequential access they are the same speed (forgetting look-ahead caching). For random access matrix is faster.
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?i2za0777e081004230818y9008c7b7yc574298df85933dc>