• ## PAT A1089 Insert or Merge (25point(s))

According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, inserti

查看全文
• ## PAT A1098 Insertion or Heap Sort (25point(s))

According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, inserti

查看全文
• ## PAT A1099 Build A Binary Search Tree (30point(s))

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 w

查看全文
• ## PAT A1141 PAT Ranking of Institutions (25point(s))

After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the rank

查看全文
• ## PAT A1137 Final Grading (25point(s))

For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certif

查看全文
• ## PAT A1125 Chain the Ropes (25point(s))

Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one

查看全文
• ## PAT A1113 Integer Set Partition (25point(s))

Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2 numbers, respectively. Le

查看全文
• ## PAT A1101 Quick Sort (25point(s))

There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then th

查看全文