Shulou(Shulou.com)06/02 Report--

This article introduces the relevant knowledge of "what is the advantage of chain stack and sequence stack in windows". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

Compared with the sequential stack, the advantage of the chain stack is that the stack is usually not full. Because the sequential stack is implemented in an array, the size of the stack must be determined in advance, the use of memory is not efficient, and the overflow problem caused by running out of array space can not be avoided, while the chain stack generally does not appear full because of dynamic memory application.

The operating environment of this tutorial: windows7 system, Dell G3 computer.

Compared with the sequential stack, the chain stack has an obvious advantage: the stack is usually not full.

Because the sequential stack is implemented in an array, the size of the stack must be determined in advance, the use of memory is not efficient, and the overflow problem caused by running out of array space can not be avoided; while the chain stack because of the dynamic application of memory, generally there will not be full stack, empty stack will still occur.

Because both the chain stack and the sequential stack are stacks, the stack can only insert and delete at the top of the stack, so the chain stack has no advantage over the sequential stack in the insert and delete operation.

Stack

As a data structure, stack is a special linear table that can only insert and delete at one end. It stores data according to the last-in-first-out principle, the first-in data is pressed into the bottom of the stack, the last data is at the top of the stack, and the data pops up from the top of the stack when it needs to be read (the last data is read out first). The stack has the function of memory, and there is no need to change the pointer at the bottom of the stack in the insertion and deletion of the stack.

A stack is a special linear table that allows inserts and deletions on the same side. One end that allows insert and delete operations is called the top of the stack (top), and the other end is the bottom of the stack (bottom); the bottom of the stack is fixed, and the top of the stack is floating; 00:00 in the number of elements in the stack is called empty stack. Insertion is generally called PUSH, while deletion is called POP. The stack is also known as a first-in-first-out table.

The stack can be used to store breakpoints when a function is called, and it is used for recursion!

Stack plays an important role in the operation of the program. The most important thing is that the stack holds the maintenance information needed for a function call, which is often called a stack frame or activity record. Stack frames generally contain the following information:

1. Return address and parameters of the function

2. Temporary variables: including non-static local variables of the function and other temporary variables automatically generated by the compiler.

This is the end of the content of "what are the advantages of chain stack and sequential stack in windows". Thank you for reading. If you want to know more about the industry, you can follow the website, the editor will output more high-quality practical articles for you!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.