can some one tell how to keep the values of numbers in a 2-d array stored when size is too big. like array[10^6][10^6] will definitely run out of space. is there an effective data structure or an STL container that enables me store these values and then search in O(1) time.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
