Cursor Agent ALOGOL

[ewdlop]

Copoilot: "This pull request adds a comprehensive ALGOL 68 implementation for various algorithmic topics covered in "Hello 算法". It introduces a new directory structure for ALGOL 68 code, including detailed implementations and documentation for arrays, linked lists, computational complexity (time, space, recursion), backtracking, and divide and conquer algorithms. The changes provide both code examples and explanations in Chinese, and include instructions for compiling and running ALGOL 68 code.

Key changes:

Documentation and Structure

• Added README.md in codes/algol/ with an overview of ALGOL 68, directory structure, compilation instructions, language notes, and resource links.
• Minor update to WIKI.md to clarify documentation integration.

Array and Linked List Implementations

• Implemented array operations in array.alg, covering printing, access, insertion, deletion, traversal, and search.
• Provided a simplified linked list implementation using arrays in linked_list.alg, including node access, insertion, deletion, and search.

Computational Complexity Examples

• Added time complexity examples in time_complexity.alg, with procedures for constant, linear, quadratic, exponential, logarithmic, linear-logarithmic, and factorial time complexities, including bubble sort and array traversal.
• Added space complexity examples in space_complexity.alg, showing constant, linear, and quadratic space usage, both iterative and recursive.
• Included iteration examples (iteration.alg) with different loop structures, and recursion examples (recursion.alg) with standard, iterative, tail, and Fibonacci recursion. [1] [2]
• Added worst/best case time complexity demonstration in worst_best_time_complexity.alg.

Backtracking and Divide & Conquer

• Implemented backtracking solutions for permutations (permutations_i.alg) and the n-queens problem (n_queens.alg). [1] [2]
• Added recursive binary search in binary_search_recur.alg."