Programmer Think

Summary Bubble, Select, Insert, Merge, Fast, Hill, Heap Sort, are all sort based on comparison The lowest average complexity is O(nlog(n)) Count, bucket, cardinality sort, not comparison-based sort Is a typical space-exchange time, and in some cases, the average time complexity can be lower than O(nlog(n)) Core Ideas Count the n ...

Java 8 uses Stream stream to operate List create object //user object public class UserPO { @ApiModelProperty(example = "", required = false, value = "Serial number") private Integer id; @ApiModelProperty(example = "", required = false, value = "full name") private String name; @ApiModelProperty(example = "", required ...

Reverse linked list ​ Title link here Three pointers: Problem solving ideas: First analyze the special case. When the linked list is empty or there is only one node, directly return to head When there are more than one node in the linked list, we first consider whether we can reverse the pointer in turn, so as to reverse the linked list ...

Data structure and algorithm sort Merge sort (divide and conquer algorithm) The idea is to recursively split the array, compare and replace it, and then merge it Code implementation: package com.xu.fingeroffer.recursion; import java.util.Arrays; public class Merge sort { public static void main(String[] args) { int a[] = {9, ...

This article is the second in the series of hand tearing ring queue. The links to previous articles are as follows:Hand tearing ring queue The previous article introduces a basic ring queue, which can be used in multithreading, but there is one premise:At any time, there can only be one producer and one consumer. In other words, if multiple p ...

⭐ Introduction ⭐ ️ Hello, I'm Zhijie. Today we will bring you a set of special training questions for hash questions. Hash table plays a very important role in data structure. Many students always learn theoretical knowledge and lack practical use. The so-called generals are all killed from the battlefield. If you want to become the great God ...

Linear table A linear list is a finite sequence of n data elements with the same characteristics. Linear table is a data structure widely used in practice. Common linear tables: sequential table, linked list, stack, queue, stringA linear table is logically a linear structure, that is, a continuous straight line. But in physical structure I ...

Task description Write a simple one-way linked list to manage a group of ordered integers with variable length (query, insert, modify and delete). Programming requirements (1) Create a one-way linked list, whose node contains two integer data fields: number and xuhao (the serial number increases from 1, and the serial numbers of two ...

Graph traversal: starting from a vertex of a connected graph, access and traverse all vertices in the graph along some edges, and each vertex is accessed only once. This is called graph traversal, which is the basic operation of the graph Traversal essence: the process of finding the adjacency point of each vertex Characteristics of graph: ...

What is a linear table for? (sequential list and linked list) linear storage data Stack concept: implemented with linear table - last in first out - LIFO last in first out Stack (also known as stack): a container that can store data elements for access and deletion Single end operation: it is only allowed to add (push) and output (pop) data ...