Description: Sorting algorithm and data structure, mainly written in pseudo-code, easy to queryv

Plat: C/C++ | Size: 4234KB | Downloads: 0

Description: The main program of hierarchical clustering using B-Tree.

Plat: matlab | Size: 7KB | Downloads: 4

Description: Introduction algorithm chapter 2 multiple sorting algorithms

Plat: Java | Size: 2KB | Downloads: 0

Description: Based on the program of MATLAB, the functions of license plate recognition, timing and automatic charging of parking lot are realized

Plat: matlab | Size: 9804KB | Downloads: 0

Description: Advanced Python Programming,pdf type document

Plat: Python | Size: 125KB | Downloads: 1

Description: Data Structure and Algorithm open kattis solution to some problems

Plat: Java | Size: 44KB | Downloads: 0

Description: Mainly includes stack, queue, linear table sequential storage structure and link storage structure to achieve code

Plat: C/C++ | Size: 13592KB | Downloads: 1

Description: It is the source code of teacher Chen Huinan's linear table class and sequential table class.

Plat: C/C++ | Size: 3035KB | Downloads: 0

Description: Data structure and algorithm and sample code

Plat: Java | Size: 5864KB | Downloads: 1

Description: Code scripts: set algorithms, crawlers, AI small projects, data structure algorithms, and so on

Plat: C/C++ | Size: 24KB | Downloads: 0

Description: Combining two ordered numbers into an ordered array with time complexity of O(max(n,m)).

Plat: C/C++ | Size: 2092KB | Downloads: 0

Description: The binary tree is reconstructed by pre-order traversal and mid-order traversal.

Plat: C/C++ | Size: 2156KB | Downloads: 0

Description: Use Python to realize the purpose of predicting future parking acquirement, using Static incidence model.

Plat: Python | Size: 1KB | Downloads: 1

Description: data structures and programming language and objective

Plat: C/C++ | Size: 2496KB | Downloads: 0

Description: Programming language c and programming language C++ data structures

Plat: C/C++ | Size: 2859KB | Downloads: 0

Description: Minimum spanning tree implementation, and other basic operations, data structures commonly used

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: Hash table implementation and other basic operations

Plat: C/C++ | Size: 2KB | Downloads: 0

Description: Cluing of Binary Trees and Various Operations of Clued Binary Trees

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: Conversion between Binary Trees and Forests

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: Individuals do not recommend learning the domestic data structure textbooks. They feel that they are very shallow. They just list the theories, not as thorough as the introduction of algorithms.

Plat: C/C++ | Size: 52792KB | Downloads: 1

Description: Fundamentals of Data Structures

Plat: Java | Size: 2492KB | Downloads: 0

Description: The ranklist of PAT is generated from the status list, which shows the scores of the submissions. This time you are supposed to generate the ranklist for PAT.
Input Specification:
Each input file contains one test case. For each case, the first line contains 3 positive integers, N , the total number of users, K , the total number of problems, and M the total number of submissions. It is then assumed that the user id's are 5-digit numbers from 00001 to N, and the problem id's are from 1 to K. The next line contains K positive integers p[i] , where p[i] corresponds to the full mark of the i-th problem. Then M lines follow, each gives the information of a submission in the following format:

Plat: C/C++ | Size: 38KB | Downloads: 0

Description: According to Wikipedia:
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.
Merge sort works as follows: Divide the unsorted list into N sublists, each containing 1 element (a list of 1 element is considered sorted). Then repeatedly merge two adjacent sublists to produce new sorted sublists until there is only 1 sublist remaining.
Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
Both the left and right subtrees must also be binary search trees.
A Complete Binary Tree (CBT) is a tree that is completely filled, with the possible exception of the bottom level, which is filled from left to right.
Now given a sequence of distinct non-negative integer keys, a unique BST can be constructed if it is required that the tree must also be a CBT. You are supposed to output the level order traversal sequence of this BST.

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: Input consists of several test cases. For each test case, the first line contains two positive integers N and L,which are the total number of integers in an insertion sequence and the number of sequences to be tested, respectively. The second line contains N positive integers, separated by a space, which are the initially inserted numbers. Then L lines follow, each contains a sequence of N integers to be checked.

Plat: C/C++ | Size: 1KB | Downloads: 0

Description: data structure sorting structure applications of sorting and testing

Plat: C/C++ | Size: 621KB | Downloads: 0

Description: Implementation of various data structures

Plat: C/C++ | Size: 43KB | Downloads: 0

Description: Campus navigationCampus Navigation System A Simple C++ Language for Campus Navigation

Plat: Python | Size: 1KB | Downloads: 0

Description: Implementation function:
Void CreateList(T a[], int n); // build order table from elements in a array
Void DispList(); // Output all elements in the sequence table L
Int ListLength(); // Find the length of the sequence table
Bool GetElem(int i, T &e); // Find the element value of a serial number in the sequence table
Int LocateElem(T e); // Find its first ordinal position by element
Bool ListInsert(int i, T e); // Insert data element e at position i
Bool ListDelete(int i); // Delete data element at position i
Void ReverseList(SqListClass<T> &L); // Flip the order table

Plat: C/C++ | Size: 2KB | Downloads: 1

Description: In order table class, add the function of joining two linear tables ,it contains header files, which are the definitions of sequential tables.

Plat: C/C++ | Size: 28KB | Downloads: 0