资源列表
Morsecode_Coder
- A Console converter which translates Morsecode to Alphabetic Letters and the same way round.
Word_Count
- Console programm which calculates the word count of an inserted text. Good for educational purpose.
Cellular_Automate
- A Cellular Automate Simulator which is implemented with the use of a STL-Container and with the use of an array. Good for educational purposes, to learn how to use the copy- & move semantics, as well as the R- and L-Values in C++.
Prime_Numbers_Calculation
- Calculates all Prime Numbers till a destinated end. Good for educational purpose.
Complex_Numbers
- C written Console application to calculate with complex numbers.
Prime_Numbers
- Calculates prime numbers with use of the "Sieve of Eratosthenes".
medi
- 设X[0:n-1]和Y[0:n-1]为2 个数组,每个数组中含有n 个已排好序的数。试设计一个 O(log n)时间的算法,找出X 和Y 的2n 个数的中位数。-Let X [0: n-1] and Y [0: n-1] for the two arrays, each array containing the n number has been sorted. Try to design an O (log n) time algorithm to find the X and Y 2n
BigInt
- 大整数的四则运算以及用米勒拉丁法来产生大素数-Large integer calculation and generation of large prime numbers
medo
- 设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中-Let X [0: n- 1
2
- 校园一卡通管理系统，实现学生信息的录入，查找，电子帐户的使用查询-Campus card management system, student information input, search, e-mail account using a query
manager
- 小商品管理系统，实现商品的分录，查询，总价统计-Commodity management system, product entry, query, total statistics
origin
- 五子棋小游戏，可以实现双人队战，人机对战-331 small game, you can achieve double team battle, man-machine war