Is it possible to map a 32 structure onto an 8 bit structure ? Also, can we do it in an intelligent way, involving a bit of learning?

Vote count:

0

An example would be with an analogy.

Say, if I have an integer array of length 2^32 space, with its index starting from 0. All the number stored in this array are unique.

Now I have another integer array of 2^8 space (256 spaces), with its index also starting from 0.

I have numbers randomly fetched from the 1st larger array in a random manner. And I decide to store these numbers in the same order, (in which they were stored in the larger array), in the smaller array of 256 space.

So my question is it possible to store these numbers in the smaller array, with least time complexity, space complexity, space wastage and no sorting ?

Eg:

Say number stored in the 2nd place, 4th place, 20000 place, 10000 place are fetched randomly from the 1st queue.

So how to store them in the same order in the smaller queue ? (No sorting please)

Also, these numbers are fetched only upto, say 16 times.

And if the 16 iterations are repeated, then can we use learning to predict what would be the most suitable placement (INDEX) for the next number being popped from the larger array into the smaller array ?

asked 2 mins ago

ariadon1992

1