(C Speech introduction table Classic algorithm, old Hanoi Taffe series Baska triangle tricolor chess mouse wandering officer (I) mouse wandering officer (II) knight walking on the chessboard eight queens eight silver coins life game string check bicolor, tricolor Hanoi tower knapsack problem number, operation Monte Carlo method to find PIErasthenes choose to find prime number super long integer operation (large number operation) long PI maximum common factor, minimum common multiple Factorization Perfect number Armstrong number Maximum number of visitors The operation of the order form to the order form (the former order form) The latter order form is used for gambling, shuffling cards (random number placement) Craps, gambling games, Josephus Problem, scheduling, combination, Gray Code, generation of possible m elements, subsets of n elements, digital disassembly, sorting, scoring, ranking, selection, penetration Bubble Sorting Shell Sorting Method - Improved Spike Sorting Shaker Sorting Method - Improved Bubble Sorting Heap Sorting Method - Improved Selective Sorting Quick Sorting Method (I) Quick Sorting Method (II) Quick Sorting Method (III) Combined Sorting Method Cardinal Sorting Method Search Sequential Search Method Symmetric matrix odd magic square matrix 4N magic square matrix 2 (2N 1) magic square matrix
Classic c Algorithm.txt)
收藏
