5. Data-structures

  • 5.2. Insert sort

    5.2.1. I. the concept and its introduction ¶ Insert sort (InsertionSort), also known as direct insert sort. It is a...
    2025-10-25 13:35:40 UTC
  • 5.3. Hill ranking

    5.3.1. I. the concept and its introduction ¶ Hill sorting (Shell Sort) is a kind of insertion sorting, which is an im...
    2025-10-25 13:35:42 UTC
  • 5.4. Merge and sort

    5.4.1. I. the concept and its introduction ¶ Merge sorting (Merge sort) is an effective and stable sorting algorithm ...
    2025-10-25 13:35:41 UTC
  • 5.5. Randomized quick sort

    5.5.1. I. the concept and its introduction ¶ Quick sorting was proposed by C. A. R. Hoare in 1960. 随机化快速排序基本思想: T...
    2025-10-25 13:35:39 UTC
  • 5.6. Two-way quick sorting

    5.6.1. I. the concept and its introduction ¶ The two-way quick sort algorithm is an improved version of randomized qu...
    2025-10-25 13:35:39 UTC
  • 5.7. Three-way sorting algorithm

    5.7.1. I. the concept and its introduction ¶ Three-way quick sorting is a further improved version of two-way quick s...
    2025-10-25 13:35:42 UTC
  • 5.9. Basic storage of heap

    5.9.1. I. the concept and its introduction ¶ Heap is a general term for a special kind of data structure in computer ...
    2025-10-25 13:35:40 UTC
  • 5.10. Heap shift up

    This section describes how to add elements to a maximum heap called shift up . Suppose we add a new element 52 to the la...
    2025-10-25 13:35:41 UTC
  • 5.11. Heap shift down

    This section describes how to take an element from the largest heap, called shift down, and only take out the element with t...
    2025-10-25 13:35:39 UTC
  • 5.12. Basic heap sorting

    5.12.1. I. the concept and its introduction ¶ Heap sorting (Heapsort) is a sort algorithm designed by using the data ...
    2025-10-25 13:35:40 UTC
  • 5.13. Optimized heap sorting

    In the heap sorting in the previous section, we opened up additional space to construct and sort the heap. In this section, ...
    2025-10-25 13:35:41 UTC
  • 5.14. Index reactor and its Optimization

    5.14.1. I. the concept and its introduction ¶ Index heap is the optimization of the data structure of heap. The ind...
    2025-10-25 13:35:40 UTC
  • 5.15. Binary search tree

    5.15.1. I. the concept and its introduction ¶ Binary search tree (English: Binary Search Tree), also known as binary ...
    2025-10-25 13:35:41 UTC
  • 5.16. Insertion of binary search tree nodes

    First, define a binary search tree. The Java code is as follows: public class BST, Value> { // 树中的节点为私有的类, 外界不需要了解二分搜...
    2025-10-25 13:35:40 UTC
  • 5.17. The search of binary search Tree nodes

    There is no subscript in the binary search tree, so for the search operation of the binary search tree, a contain method is ...
    2025-10-25 13:35:39 UTC

Principles, Technologies, and Methods of Geographic Information Systems

 102

In recent years, Geographic Information Systems (GIS) have undergone rapid development in both theoretical and practical dimensions. GIS has been widely applied for modeling and decision-making support across various fields such as urban management, regional planning, and environmental remediation, establishing geographic information as a vital component of the information era. The introduction of the “Digital Earth” concept has further accelerated the advancement of GIS, which serves as its technical foundation. Concurrently, scholars have been dedicated to theoretical research in areas like spatial cognition, spatial data uncertainty, and the formalization of spatial relationships. This reflects the dual nature of GIS as both an applied technology and an academic discipline, with the two aspects forming a mutually reinforcing cycle of progress.