![]() Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Usually, efficient data structures are key to designing efficient algorithms. ĭata structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. For example, relational databases commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers. ĭifferent types of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. The data structure implements the physical form of the data type. ![]() The ADT defines the logical form of the data type. Data structures serve as the basis for abstract data types (ADT). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |