- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 1 of 1 (0.078 seconds)Spelling suggestions: "subject:"cynamic double linked list"" "subject:"clynamic double linked list""
| 1 |
Dinaminės duomenų struktūros ir kai kurių jų algoritmų realizavimas rodyklėmis / Dynamic Data Structures And The Realisation Of Some Algorithms By PointersSuchaževskaja, Tatjana 08 June 2005 (has links)
The present research paper deals with the comparison of static and dynamic data structures: static array, dynamic array, pointers array - class TList (Delphi) and dynamic doubly linked list, created with the help of recursive record.To compare the above mentioned structures, sorting (Bubble) and convex hull creation algorithms (Graham, Endrew) are realized, with the time of their implementation analysed. The algorithm of sorting (Bubble) is realized by four ways: static array, dynamic array, pointers array (class TList) and a dynamic doubly linked list, created with the help of recursive record.The algorithms of convex hull creation (Graham, Endrew) is realized by three ways: static array, dynamic array and pointers array (TList).The research paper also describes the pointers array class TList (Delphi), its properties and methods. The sorting method Sort of this class is compared with the sorting method of a “Bubble”. Using class templates, a universal class MList (C++) was created for work with dynamic linear linked lists.
|
Page generated in 0.0821 seconds