Search found 1 match

Go to advanced search

by Chadwickiee
Mon Jul 19, 2004 6:32 am
Forum: Volume 101 (10100-10199)
Topic: 10152 - ShellSort
Replies: 33
Views: 14756

to Map or Not to Map

I am wondering if it is neccessary to map the indices of one array to another in order to get the solution in O(n)?

My solution in Java ran in about 5.39 using a Hashtable O(n).
My solution in C++ ran in about .996 using nested loops to mapping.O(n^2)

I can not for the life of me get a hashCode ...

Go to advanced search