解决oracle服务器占用大CPU的进程清理

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

这是一个测试的输入和输出的一些花哨的文本样品和音频也许以后： D： 

HTML5 浪漫爱心表白动画在线演示.htm 修改一下可以在情人节送给女友，表达心意。画面很漂亮。

实现数控电压源的精确控制，从0――15V-NC precise control of voltage source, from 0- 15V

linux下运行的撞球游戏-running under billiard game

线性分析,自己的作业,用于fisher的线性分类器-linear analysis, its own operations, for the fisher linear classifier

输局哭电饭锅发动股份电饭锅发动规划规范化股份的韩国发行股份规范化分工很过分-45ftdgfd

本文详细讲述了图像细化算法的基础知识，能够给研究图像细化算法的图像处理工作者提供较好的参考-In this paper, a detailed account of the image thinning algorithm based on knowledge, able to image thinning algorithm to the study of image processing workers to provide better reference

用于 数据转换f-for data conversion f

Linux　２。６内核ROS多功能路由器，集网管，DHCP，上网控制，VPN,PPOE拨号为一身-Linux 2. 6 core ROS multifunctional router, set management, DHCP, Internet access control, VPN, PPOE for a dial-up