Difference between revisions of "TADM2E 3.3"
From Algorithm Wiki
(Recovering wiki) |
(Recovering wiki) |
||
| Line 1: | Line 1: | ||
| − | 1. size 4 array with 3 elements. remove 1, insert 1, and so forth. | + | 1. size 4 array with 3 elements. remove 1, insert 1, and so forth. <br> |
2. when the array is one-fourth full, shrink its size to half of what it was. | 2. when the array is one-fourth full, shrink its size to half of what it was. | ||
[[Data-structures-TADM2E|Back to ''Data Structures'' Problems]]... | [[Data-structures-TADM2E|Back to ''Data Structures'' Problems]]... | ||
Revision as of 18:22, 11 September 2014
1. size 4 array with 3 elements. remove 1, insert 1, and so forth.
2. when the array is one-fourth full, shrink its size to half of what it was.
