Data Structure and algorithm Overview (1)

The first chapter of the soft test video is about the data structure. This part of content has been learned in the self-examination book and has been used in the past. In short, it is a familiar feeling. Suddenly there seems to be a lot of data structures, but when you sort them out, you will find that the data structure is so neat.

In solving any practical problems, computers cannot do without data representation and processing. one of the core problems of data representation and processing is data structure. Data structure is the way computers organize data and store data. Data structure is the underlying knowledge of computers, which is enough to attract our attention. Therefore, we must first learn from such a positioning.

Chapter 1 can be divided into two parts: data structure (including Logical Structure and storage structure) and algorithm (including search sorting ). Different data structures determine the algorithm execution speed. These two parts are closely related.

(1) Data Structure

The data structure is nothing more than what structure the data is organized inside the computer. Linear tables, binary trees, and graphs that we often hear or use can be divided into two types: logic and storage. The so-called logic is a structure that people can imagine subjectively, and storage is a physical storage method. The logical structure of data is stored in a computer in one or more ways.

(2) algorithms

When data is stored in a computer, we need to modify it, such as inserting or deleting or searching for and reading data. This involves algorithms, searches for and operates data in a data structure. This article mainly introduces sorting and searching. searching is to find the location of a data in the data structure, and sorting is to re-sort the data size.

I personally think that the sorting algorithm is more complicated, mainly because there are many types. There are only three types of search. Sequential search and binary search can be used to search for linear stored data. segmented search involves indexes. Evaluating an algorithm is about its time complexity and space complexity. I understand the algorithm at the time, but I can't even summarize it later. I forget it so quickly. So I should review what I learned before and compare it. For details about the algorithms (mainly compiled by Alibaba Cloud), please wait for the next part.

Test tips:

I forgot. I always quickly understand something and forget it.

I'm impatient. After reading the video two days ago, I made a set of questions. It was really sad. I felt that the video was the same as I did not watch (a little exaggerated), but I felt that I could not do that much, I couldn't wait for a moment. I talked to people in the same group. They said we would learn it several times. No one could learn the club's knowledge once, otherwise, it will not be prepared for three months. It's my problem. I have made another mistake. I always want to eat a fat man. In fact, I didn't think about what I learned, but it was just as far as I expected.

Drawing is very important. We have always said that we should sum up. In fact, we are summing up the drawing process.

Data Structure and algorithm Overview (1)