Search code examples
calgorithmdata-structureshashtableobject-oriented-database

need to know what is exactly a resizable dynamic data structure

I'm a software engineer student, and we are studying C. Actually we are deal with data structure, so in some of my search about hash tables especially linear probing I read the term of "resizable dynamic data", but hardly I found a good explanation. Please help me to discover more about..

Solution
    • Probably Dynamic Array's/ Data Structures. ( Any structure whose data capacity/values tend to be dynamic in nature)

    • In the case of Dictionaries(aka HashMaps), it would be Dynamic Value specification or Dynamic Key access or Dynamic items). The reason is because key access is O(1) time and any key lookup is possible either the key would be Integer or String or SingleCharacter.

    • In the case of Rendering( it would be Dynamic Resizing Rendered Components).

    • In the case of Mobile Development (it would be Dynamic Resizable Placement: Check Kivy for this))