China 
Africa 
Explore chapters and articles related to this topic
Applications of Graph Theory
Published in Rowan Garnier, John Taylor, Discrete Mathematics, 2020
The heap sort algorithm also uses a special kind of binary tree, called a ‘heap', whose vertices are again members of the list to be sorted. The ‘shape' of a heap is such that it has the smallest possible height for the number of its vertices. This is achieved by ensuring that, if we ignore its highest level, the remainder of the tree is both complete and full. In addition, the leaf vertices at the highest level are situated as far to the left of the diagram as possible. These two conditions determine the shape of the diagram of a heap (see figure 11.10 below). The last condition in the following definition refers to the relationships between the vertices.
Artificial Intelligence-based Solution for the Prediction for Power Consumption in Electronics and Software Applications
Published in IETE Journal of Research, 2022
Savitha C, Prabodh Khampariya, Kamred Udham Singh, Ankit Kumar, Teekam Singh, Chetan Swarup
According to the results of this study, it is assumed that native code performs better than high-level languages like Java; however, the actual results demonstrate that the execution time varies on the operation type. Comparing Java vs. Android code in terms of run time, $ uses 12 prominent benchmarks that are grouped into the following categories: Numerical computation with recursion: Benchmarks such as Ackermann and Fibonacci measures the amount of time required to execute recursive function calls and the amount of time required to manage memory.Library facilities: Hash and Hash2 are two programmes that test the runtime of the hash-Maps implementation used in libraries. In Java, the non-standard GCC hash map is utilized for the hash map library. However, in C++, the standard library that is given by the Hash Map class in Java is used.User-created data structure: Heapsort and Matrix tests do not depend on a library but implement custom data structures and test the execution time of their operations.Polymorphism: To determine how long it takes to make a call at any given time, this test uses both the Methcall and Objinst benchmarks.Nested loops - This evaluation consists of six levels of nesting loops, each of which executes N rounds.Random Number Generation - Calculations based solely on numbers are required for this test; there are very few variables and no data structures.Eratosthenes Sieve - It is a straightforward approach for quickly discovering prime numbers. We make use of an array of Boolean values, where each member denotes whether or not the value of its index can be prime Figure 5.