Algorithms in data structures

Lecture Data Structures: Lesson 31 provide students with knowledge about buildheap; the general algorithm is to place the N keys in an array and consider it to be an unordered binary tree; the following algorithm will build a heap out of N keys;...

16p hanthienngao 15-04-2022 15 2   Download

Lecture Data Structures: Lesson 32 provide students with knowledge about heap code in C++; buildheap in linear time; how buildHeap a linear time algorithm; complete binary tree; marking the left edges for height 1 nodes; marking the first left edge and the subsequent right edge for height 2 nodes;...

16p hanthienngao 15-04-2022 17 2   Download

Goals of the dissertation: This thesis focuses on studying and developing meta-heuristic optimization methods and combines them with the Artificial Neural Network, which has advantages in approximating data, to build up a new algorithm for solving composite material structural optimization problems.

136p monsterhunterer 20-06-2021 10 3   Download

It’s convenient to describe a data structure in terms of the operations performed, rather than in terms of implementation details. That means we should separate the concepts from particular implementations. When a data structure is defined that way, it’s called an abstract data type (ADT).

124p janeeyre_thanh 12-08-2013 77 16   Download

Cây đỏ đen được ra giới thiệu bởi Rudolf Bayer trong quyển “Symmetric Binary B-Trees: Data Structure and maintenance Algorithms”, nhà xuất bản Acta Informatica, Tâp1, trang 290-306. Sau đó Leonidas J.Guibas và Robert Sedgewick đã thêm các đặc tính của cây đỏ đen và đặt tên cho nó ( Tham khảo: Guibas, L. and Sedgewick R. “ A dichromatic Framwork for Balanced Trees”, in Proc. 19th IEEE Symp. Foundations of Computer Science, trang 8-21, năm 1978)....

31p quanvokiem 10-03-2010 228 77   Download