Return to search

Dinaminės duomenų struktūros ir kai kurių jų algoritmų realizavimas rodyklėmis / Dynamic Data Structures And The Realisation Of Some Algorithms By Pointers

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.

Identiferoai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2005~D_20050608_172624-42734
Date08 June 2005
CreatorsSuchaževskaja, Tatjana
ContributorsMelničenko, Grigorijus, Kazlauskas, Kazys, Stankevičienė, Eglė, Dzemyda, Gintautas, Šaltenis, Vydūnas, Vilnius Pedagogical University
PublisherLithuanian Academic Libraries Network (LABT), Vilnius Pedagogical University
Source SetsLithuanian ETD submission system
LanguageLithuanian
Detected LanguageEnglish
TypeMaster thesis
Formatapplication/pdf
Sourcehttp://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050608_172624-42734
RightsUnrestricted

Page generated in 0.0024 seconds