国产av日韩一区二区三区精品,成人性爱视频在线观看,国产,欧美,日韩,一区,www.成色av久久成人,2222eeee成人天堂

Home Backend Development C++ Heap and priority queue in C++

Heap and priority queue in C++

Aug 22, 2023 pm 04:16 PM
heap c++ priority queue

Heap and priority queue in C++

Heap and priority queue are commonly used data structures in C, and they both have important application value. This article will introduce and analyze the heap and priority queue respectively to help readers better understand and use them.

1. Heap

The heap is a special tree data structure that can be used to implement priority queues. In the heap, each node satisfies the following properties:

  1. Its value is not less than (or not greater than) the value of its parent node.
  2. Its left and right subtrees are also a heap.

We call a heap that is no smaller than its parent node a "min heap" and a heap that is no larger than its parent node a "max heap". In addition, the heap is usually a complete binary tree, that is, the nodes in other levels are full except for the last level, where the nodes are arranged from left to right.

In C, the STL library provides two classes, heap and priority_queue, to implement the heap. Among them, the heap class provides heap operation functions, such as make_heap, push_heap, pop_heap, etc., and the priority_queue class is a priority queue based on the heap implementation. Next, let's take a look at the usage of heap and priority_queue.

  1. heap class

(1) Create a heap

Before creating a heap, you need to create a vector type array to store the numbers to be sorted :

vector v = { 3, 1, 4, 1, 5, 9, 2, 6, 5, 3 };

Then, we can use the make_heap function to vector The array of type is converted to a heap:

make_heap(v.begin(), v.end(), greater());

where greater() means Comparison function can control the type of heap.

(2) Insert elements

To insert elements into the heap, you can use the push_heap function. Its usage is as follows:

v.push_back(7);
push_heap( v.begin(), v.end(), greater());

(3) Delete elements

To delete elements in the heap, you can use the pop_heap function, which will The top element of the heap is moved to the last position of the heap and the element is removed from the heap. The usage of this function is as follows:

pop_heap(v.begin(), v.end(), greater());
v.pop_back();

  1. priority_queue class

(1) Create a heap

Unlike the heap class, the priority_queue class can specify the type of heap when declaring the object, as follows:

priority_queue, greater> q;

This means creating a minimum heap.

(2) Insert elements

Inserting elements into priority_queue can directly use the push function, as shown below:

q.push(2);
q. push(4);
q.push(1);
q.push(9);

(3) Delete elements

You can use it directly to delete elements in priority_queue The pop function is as follows:

q.pop();

2. Priority queue

The priority queue is a special queue that sorts elements according to their priority. Sort and place the elements with the highest priority at the front of the queue and the elements with the lowest priority at the end of the queue. You can use a heap to implement a priority queue.

In C, the priority_queue class is a priority queue implemented based on the heap. It can use the functions in the above heap and priority_queue classes to perform element insertion and deletion operations. In addition, the top function is also provided in the priority_queue class, which is used to access the element with the highest priority, as shown below:

priority_queue q;
q.push(2);
q .push(4);
q.push(1);
q.push(9);
cout

Summary:

This article introduces the heap and priority queue in C, and analyzes the usage and implementation principles of the heap and priority queue respectively. By studying this article, readers can better understand these two data structures and use them flexibly in actual programming. At the same time, readers should pay attention to the timing and precautions for using the heap and priority queue to ensure the correctness and efficiency of the code.

The above is the detailed content of Heap and priority queue in C++. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undress AI Tool

Undress AI Tool

Undress images for free

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

Hot Topics

PHP Tutorial
1502
276
How to develop AI-based text summary with PHP Quick Refining Technology How to develop AI-based text summary with PHP Quick Refining Technology Jul 25, 2025 pm 05:57 PM

The core of PHP's development of AI text summary is to call external AI service APIs (such as OpenAI, HuggingFace) as a coordinator to realize text preprocessing, API requests, response analysis and result display; 2. The limitation is that the computing performance is weak and the AI ecosystem is weak. The response strategy is to leverage APIs, service decoupling and asynchronous processing; 3. Model selection needs to weigh summary quality, cost, delay, concurrency, data privacy, and abstract models such as GPT or BART/T5 are recommended; 4. Performance optimization includes cache, asynchronous queues, batch processing and nearby area selection. Error processing needs to cover current limit retry, network timeout, key security, input verification and logging to ensure the stable and efficient operation of the system.

C   bit manipulation example C bit manipulation example Jul 25, 2025 am 02:33 AM

Bit operation can efficiently implement the underlying operation of integers, 1. Check whether the i-th bit is 1: Use n&(1

C   function example C function example Jul 27, 2025 am 01:21 AM

Functions are the basic unit of organizing code in C, used to realize code reuse and modularization; 1. Functions are created through declarations and definitions, such as intadd(inta,intb) returns the sum of the two numbers; 2. Pass parameters when calling the function, and return the result of the corresponding type after the function is executed; 3. The function without return value uses void as the return type, such as voidgreet(stringname) for outputting greeting information; 4. Using functions can improve code readability, avoid duplication and facilitate maintenance, which is the basic concept of C programming.

C   decltype example C decltype example Jul 27, 2025 am 01:32 AM

decltype is a keyword used by C 11 to deduce expression types at compile time. The derivation results are accurate and do not perform type conversion. 1. decltype(expression) only analyzes types and does not calculate expressions; 2. Deduce the variable name decltype(x) as a declaration type, while decltype((x)) is deduced as x due to lvalue expression; 3. It is often used in templates to deduce the return value through tail-set return type auto-> decltype(t u); 4. Complex type declarations can be simplified in combination with auto, such as decltype(vec.begin())it=vec.begin(); 5. Avoid hard-coded classes in templates

C   binary search tree example C binary search tree example Jul 28, 2025 am 02:26 AM

ABinarySearchTree(BST)isabinarytreewheretheleftsubtreecontainsonlynodeswithvalueslessthanthenode’svalue,therightsubtreecontainsonlynodeswithvaluesgreaterthanthenode’svalue,andbothsubtreesmustalsobeBSTs;1.TheC implementationincludesaTreeNodestructure

C   fold expressions example C fold expressions example Jul 28, 2025 am 02:37 AM

C folderexpressions is a feature introduced by C 17 to simplify recursive operations in variadic parameter templates. 1. Left fold (args...) sum from left to right, such as sum(1,2,3,4,5) returns 15; 2. Logical and (args&&...) determine whether all parameters are true, and empty packets return true; 3. Use (std::cout

C   range-based for loop tutorial C range-based for loop tutorial Jul 27, 2025 am 12:49 AM

C's range-basedfor loop improves code readability and reduces errors by simplifying syntax. Its basic structure is for(declaration:range), which is suitable for arrays and STL containers, such as traversing intarr[] or std::vectorvec. Using references (such as conststd::string&name) can avoid copy overhead and can modify element content. Notes include: 1. Do not modify the container structure in the loop; 2. Ensure that the range is effective and avoid the use of freed memory; 3. There is no built-in index and requires manual maintenance of the counter. Mastering these key points allows you to use this feature efficiently and safely.

C   call python script from C   example C call python script from C example Jul 26, 2025 am 07:00 AM

Calling Python scripts in C requires implementation through PythonCAPI. First, initialize the interpreter, then import the module and call the function, and finally clean up the resources; the specific steps are: 1. Initialize the Python interpreter with Py_Initialize(); 2. Load the Python script module with PyImport_Import(); 3. Obtain the objective function through PyObject_GetAttrString(); 4. Use PyObject_CallObject() to pass parameters to call the function; 5. Call Py_DECREF() and Py_Finalize() to release the resource and close the interpreter; in the example, hello is successfully called

See all articles