搜索资源列表
QuickSort
- 快速排序之所比较快，因为相比冒泡排序，每次交换是跳跃式的。每次排序的时候设置一个基准点，将小于等于基准点的数全部放到基准点的左边，将大于等于基准点的数全部放到基准点的右边。这样在每次交换的时候就不会像冒泡排序一样每次只能在相邻的数之间进行交换，交换的距离就大的多了。因此总的比较和交换次数就少了，速度自然就提高了。-Quick sort of the relatively fast, as compared to bubble sort, each exchange is leaps and bo
Conditional-diagnosability-of-alternating-group-n
- The growing size of a multiprocessor system increases its vulnerability to component failures. In order to maintain the system’s high reliability, it is crucial to identify and replace the faulty processors through testing, a process known as fau
Test_sastore
- Array Index Out Of Bounds Exception Source Code for Linux.
StringIndexOutOfBoundsExceptionTest
- String Index Out Of Bounds Exception Test Source Code for Linux.
ArrayIndexOutOfBoundsExceptionTest
- Array Index Out Of Bounds Exception Test Source Code for Linux.
-tangchi-vc-dm
- 贪吃蛇 蛇每吃一个食物，蛇身增加一节，如果碰到边界，则蛇就死亡。-how snake eats food .if snake knocks bounds ,it will die. if snake eats food ,it will add its body one node.
Integral
- A wrapper for quad (or any other integration function) to deal with infinite bounds
Rect
- Mutable rectangle bounds for Linux v2.13.6.
Test
- 简易便签，实现了事件添加，删除修改，自定义透明度，及鼠标出界去除不必要的控件，入界控件出现-Simple notes, add, delete, and realize the event modification, custom transparency, removing unnecessary controls and mouse out of bounds, appear in control mouse when.
FIAR_42
- 简易五子棋，没有图形界面化，分类，可以实现出界判断，输赢判断等主要功能。-Simple backgammon, there is no graphical interface-based, classification can be achieved out of bounds to judge, to determine winners and losers and other major functions.
bounds
- Vortex PCM ALSA driver for Linux v2.13.6.
FIAR_42
- 简易五子棋，没有图形界面化，分类，可以实现出界判断，输赢判断等主要功能。-Simple backgammon, there is no graphical interface-based, classification can be achieved out of bounds to judge, to determine winners and losers and other major functions.
IAttributeCollection
- Index Out Of Bounds Exception.
bounds
- Vortex PCM ALSA driver for Linux v2.13.6.
miscdevice
- s is always a cpu register, and the cpu does bounds checking during register load > no further bounds checks needed. -s is always a cpu register, and the cpu does bounds checking during register load > no further bounds checks needed.
4
- 1. 实现二分法求解方程。编写并使用以下函数： double SolveRoot(double(*pf)(double x),double a,double b,int n) 这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a<=x<=b)，n是循环次数。例如，如果f(x)=x*x-2，则SolveRoot (f,1,2,100)将返回1.414213562373095，即方程为x*x=2的解。二分法的原理是反复地把区间分为两个相等区
Chapter_4_-_Cramer_Rao_Lower_Bounds_for_Nonlinear
- Cramer Rao Lower Bounds for Nonlinear Filtering
android-autofittextview-master
- 可固定边界内容字体大小自适应的TextView Usage dependencies { compile me.grantland:autofittextview:0.2.+ } 创建： AutofitHelper.create(textView) 布局文件： <me.grantland.widget.AutofitLayout android:layout_width= match_parent an
JSIP_2013081510281570
- This paper investigates the generalized Pars ’s theorem of fractional Fourier transform (FRFT) for concentrated data. Also, in the framework of multiple FRFT domains, Pars ’s theorem reduces to an inequality with lower and upper bounds associated wit
vsyscall
- These symbols are defined by vsyscall.o to mark the bounds of the ELF DSO images included therein.