Array vs Hash Table vs Map for QS

Sam Kennedy · 2012-12-25, 23:15

Currently I'm using two arrays for my quadratic sieve program. One to store the values of (x + sqrt(n)), and one which I add log2(p) to for sieving.

In c++ I've read that it's possible to use Hash Tables and Maps, although I have no experience with using them.

Would either provide a performance benefit over a standard array?

fivemack · 2012-12-25, 23:25

Quote:

Originally Posted by Sam Kennedy

Currently I'm using two arrays for my quadratic sieve program. One to store the values of (x + sqrt(n)), and one which I add log2(p) to for sieving.

In c++ I've read that it's possible to use Hash Tables and Maps, although I have no experience with using them.

Would either provide a performance benefit over a standard array?

No, both would provide an enormous performance penalty

2012-12-25, 23:15	#1
Sam Kennedy Oct 2012 52₁₆ Posts	Array vs Hash Table vs Map for QS Currently I'm using two arrays for my quadratic sieve program. One to store the values of (x + sqrt(n)), and one which I add log2(p) to for sieving. In c++ I've read that it's possible to use Hash Tables and Maps, although I have no experience with using them. Would either provide a performance benefit over a standard array?

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
How to init an array in Posix bc?	ewmayer	Linux	29	2018-03-08 21:42
FNV hash challenges	Rich	Puzzles	2	2011-12-23 18:17
Pari hash table lookup	Joshua2	Software	5	2009-02-23 22:59
array of bits	Citrix	Programming	2	2005-08-21 20:06
Ubasic Array question	rn0dal	Programming	6	2004-09-15 14:57