排序
文章平均质量分 85
感觉自己就是个bug
这个作者很懒,什么都没留下…
展开
-
PAT(甲级)2020年冬季考试7-4 Chemical Equation (30分)
7-4Chemical Equation(30分)A chemical equation is the symbolic representation of a chemical reaction in the form of symbols and formulae, wherein the reactant entities are given on the left-hand side and the product entities on the right-hand side. For exam原创 2021-03-10 10:58:07 · 626 阅读 · 2 评论 -
PAT(甲级)2019年秋季考试7-2 Merging Linked Lists (25 分)
7-2 Merging Linked Lists (25 分)Given two singly linked lists L1 =a1 →a2 →⋯→an−1 →an and L2 =b1 →b2 →⋯→bm−1 →bm . If n≥2m, you are supposed to reverse and merge the shorter one into the longer one to obtain a list like a1 →a原创 2021-03-11 00:54:48 · 172 阅读 · 0 评论 -
PAT(甲级)2019年冬季考试7-2 Block Reversing (25 分)
7-2 Block Reversing (25 分)Given a singly linked list L. Let us consider every K nodes as a block (if there are less than K nodes at the end of the list, the rest of the nodes are still considered as a block). Your job is to reverse all the blocks in L. Fo原创 2021-03-11 00:55:39 · 137 阅读 · 0 评论 -
PAT(甲级)2020年春季考试7-4 Replacement Selection (30 分)
7-4 Replacement Selection (30 分)When the input is much too large to fit into memory, we have to do external sorting instead of internal sorting. One of the key steps in external sorting is to generate sets of sorted records (also called runs) with limited原创 2021-03-10 11:00:12 · 415 阅读 · 0 评论 -
1047 Student List for Course (25 分)
1047 Student List for Course (25 分)Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.Input Specification:Each in原创 2021-03-06 11:45:55 · 69 阅读 · 0 评论 -
1053 Path of Equal Weight (30 分)
1053 Path of Equal Weight (30 分)Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti . The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the path from R to any leaf node原创 2021-03-05 15:01:00 · 54 阅读 · 0 评论 -
1052 Linked List Sorting (25 分)
1052 Linked List Sorting (25 分)A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are原创 2021-03-05 14:13:05 · 66 阅读 · 0 评论 -
1055 The World‘s Richest (25 分)
1055 The World’s Richest (25 分)Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world’s wealthiest people. Now you are supposed to simulate this job, but concentrate only on the people in a certain range of原创 2021-03-05 13:53:58 · 46 阅读 · 0 评论 -
1062 Talent and Virtue (25 分)
1062 Talent and Virtue (25 分)About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people’s talent and virtue. According to his theory, a man being outstanding in both talent and virtue must be a “sage(圣人)”; b原创 2021-03-04 11:12:57 · 67 阅读 · 1 评论 -
1067 Sort with Swap(0, i) (25 分)
1067 Sort with Swap(0, i) (25 分)Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the原创 2021-03-04 10:33:19 · 41 阅读 · 1 评论 -
1075 PAT Judge (25 分)
1075 PAT Judge (25 分)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,原创 2021-03-03 10:57:32 · 49 阅读 · 0 评论 -
1080 Graduate Admission (30 分)
1080 Graduate Admission (30 分)It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate the admission procedure.Each applican原创 2021-03-02 16:23:58 · 63 阅读 · 0 评论 -
1083 List Grades (25 分)
1083 List Grades (25 分)Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.Input S原创 2021-03-02 13:31:06 · 47 阅读 · 0 评论 -
1089 Insert or Merge (25 分)
1089 Insert or Merge (25 分)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 belong原创 2021-03-02 10:54:58 · 45 阅读 · 0 评论 -
1095 Cars on Campus (30 分)
1095 Cars on Campus (30 分)Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any sp原创 2021-03-01 13:57:36 · 82 阅读 · 0 评论 -
1098 Insertion or Heap Sort (25 分)
1098 Insertion or Heap Sort (25 分)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原创 2021-03-01 12:46:40 · 145 阅读 · 0 评论 -
1137 Final Grading (25 分)
1137 Final Grading (25 分)For a student taking the online course “Data Structures” on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain no less than 200 points from the online programming assign原创 2021-02-24 12:49:25 · 99 阅读 · 0 评论 -
1141 PAT Ranking of Institutions (25 分)
1141 PAT Ranking of Institutions (25 分)After each PAT, the PAT Center will announce the ranking of institutions based on their students’ performances. Now you are asked to generate the ranklist.Input Specification:Each input file contains one test case.原创 2021-02-23 14:56:29 · 76 阅读 · 0 评论 -
PAT(甲级)2019年春季考试7-2 Anniversary (25 分)
Anniversary (25分)Zhejiang University is about to celebrate her 122th anniversary in 2019. To prepare for the celebration, the alumni association (校友会) has gathered the ID’s of all her alumni. Now your job is to write a program to count the number of alumn原创 2020-06-12 14:50:23 · 116 阅读 · 0 评论 -
1012 The Best Rank (25分)
1012 The Best Rank (25分)To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - English. At the mean time, we enco原创 2020-06-01 17:23:32 · 81 阅读 · 0 评论 -
1153 Decode Registration Card of PAT (25分)
题目详情1153 Decode Registration Card of PAT (25分)A registration card number of PAT consists of 4 parts:the 1st letter represents the test level, namely, T for the top level, A for advance and B for basic;the 2nd - 4th digits are the test site number, rang原创 2020-05-28 14:31:12 · 151 阅读 · 0 评论 -
基数排序--次位优先实现
基数排序–次位优先实现#include<iostream>using namespace std;/*基数排序 - 次位优先*//*假设元素最多有MaxDigit个关键字,基数全是同样的Radix*/#define MaxDigit 4#define Radix 10typedef int ElementType;/*桶元素*/typedef struct Node* PtrToNode;struct Node{ int key; PtrToNode Next;}原创 2020-05-26 14:05:04 · 293 阅读 · 0 评论 -
10-排序6 Sort with Swap(0, i) (25分)
10-排序6 Sort with Swap(0, i) (25分)Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the原创 2020-05-26 13:26:06 · 105 阅读 · 0 评论 -
10-排序5 PAT Judge (25分)
10-排序5 PAT Judge (25分)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原创 2020-05-26 13:25:22 · 122 阅读 · 0 评论 -
09-排序3 Insertion or Heap Sort (25分)
09-排序3 Insertion or Heap Sort (25分)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 i原创 2020-05-26 13:23:27 · 142 阅读 · 0 评论 -
09-排序2 Insert or Merge (25分)
09-排序2 Insert or Merge (25分)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 belon原创 2020-05-26 13:22:24 · 95 阅读 · 0 评论 -
各种基本排序算法的比较
09-排序1 排序 (25分)给定N个(长整型范围内的)整数,要求输出从小到大排序后的结果。本题旨在测试各种不同的排序算法在各种数据情况下的表现。各组测试数据特点如下:数据1:只有1个元素;数据2:11个不相同的整数,测试基本正确性;数据3:103个随机整数;数据4:104个随机整数;数据5:105个随机整数;数据6:105个顺序整数;数据7:105个逆序整数;数据8:105个基本有序的整数;数据9:105个随机正整数,每个数字不超过1000。输入格式:输入第一行给出正整数N(≤1原创 2020-05-26 13:21:25 · 252 阅读 · 0 评论 -
快速排序基本实现
快速排序基本实现int Median3(int A[],int Left,int Right){ int Center=(Left+Right)/2; if(A[Left]>A[Center]) swap(&A[Center],&A[Left]); if(A[Left]>A[Right]) swap(&A[Left],&A[Right]); if(A[Center]>A[Right]) swap(&A[Center],&原创 2020-05-26 14:03:59 · 222 阅读 · 0 评论