How would I reorganize an array?
Lets say I have an array of an unknown data type that I chose to remove by simply overwriting that index number by its following members
So for example, I found an item for removal in BTable[h][0] and there are
3 things in the array. I need to move BTable[h][1] into BTable[h][0] and BTable[h][2] into BTable[h][1]
Thanks
TryCode:BTable [h][0] = BTable[h][1]; BTable [h][1] = BTable[h][2]; BTable [h][2] = 0; //Assuming it's int, if not, use appropriate statement.
If my array is quite large how might I do this in a loop (its array datatype is TYPE <template class TYPE>)
Code:for (unsigned int i = 0; i != 2nd_dimension_size; ++i) { if (i == 2nd_dimension_size - 1) { // do whatever you want to do to the last index } array[h][i] = array[h][i+1]; }
Originally Posted by brewbuck:
Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.
Will that work ofr any array size?
If the array is 3 elements big and I found what I want to remove at element 3, nothing moves
if I found it at element 2, then element 3 goes into element 2 leaving element 3 empty
No. arrays have a limite in size established by the definition of size_t. On 32bit systems this is typically a unsigned long. But... it can be different. You need to check your implementation.Originally Posted by INFERNO2K
Originally Posted by brewbuck:
Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.
Have you actually tried the code I gave you?
Originally Posted by brewbuck:
Reimplementing a large system in another language to get a 25% performance boost is nonsense. It would be cheaper to just get a computer which is 25% faster.
