搜索资源列表
LILI-II
- 无线通信系统中密钥流生成器——LILI-II。以VC＋＋为编程工具，制作了操作简单，实用性较强的用户操作界面，并对Fibonacci 结构、Galois结构两种方式的LFSR-Wireless Communication System Key flow generator -- LILI-II. A VC + + programming tools, has produced a simple, practical, strong user interface, also Fibonacci s
linux_内核定时器
- 一个主程序产生两个子进程计算N=36的Fibonacci数列，然后统计进程各自的实际时间，CPU时间，用户时间和内核时间。-main program have a two-calculation process N = 36 Fibonacci sequence, and then statistical process to the actual time, CPU time, the kernel and user time to time.
recurs
- /* Divide and Conquer */ /* Find minimum and maximum from a given series of numbers */ /* by using above said policy */ gcd fibonacci-/* Divide and Conquer*/ /* Find minimum and maximum from a given series of numbers*/ /* by using
Fibonacci_encryption
- 一种Fibonacci序列变换空域加密算法和解密算法。利用Fibonacci序列产生密钥，实现图像空域加密。-The airspace of a Fibonacci sequence transform encryption algorithm and decryption algorithm. The use of Fibonacci sequence generated key encryption to achieve the image airspace.
fib1
- implementing Fibonacci algorithm using fork on Linux
FibonacciHeap
- Fibonacci堆的java实现，经测试，绝对没问题-Fibonacci heap java implementation, tested, absolutely no problem
1
- 一个FORK（）调用的实验。通过建立共享内存区来实现进程之间的通信。父进程获取Fibonacci数列长度后，创建子进程来计算，待子进程完成后，父进程输出结果-A FORK () call experiment. Through the establishment of shared memory areas to achieve communication between the process. Parent process for the length of Fibonacci sequen
ASD12DAD
- and has about rmi-iiop remote server to call a few examples include Fibonacci and 4 entered by the user computing and so onDE-and has about rmi-iiop remote server to call a few examples include Fibonacci and 4 entered by the user computing and so onW
fiblogic
- 在linux gCC中实现斐波那契算法的递归与非递归程序，在linux gcc 下编译通过。-Implemented in the linux gCC recursive Fibonacci algorithm with non-recursive procedures, the linux gcc compile.
Recursive-Fibonacci-sequence
- 斐波那契数列递归,采用c语言编写,注释齐全-Recursive Fibonacci sequence, using c language, complete notes
Fibonacci-series
- Fibonacci数列的特点是第1，2两个数为1，1。从第3个数开始，该数是前两个数之和。求这个数列的前30个元素。-Fibonacci sequence is characterized by two numbers 1,2 1,1. The first three numbers from the beginning, the number and the sum of the first two. 30 elements before seeking this series.
DecodeStrategy
- 本代码实现三种解密的策略，包括顺序查找法，折半查找法以及斐波那契查找法-This code decryption achieve three strategies, including sequential search method, binary search method, and the Fibonacci search method
lab1
- 用NASM汇编语言实现不同颜色的斐波那契数列输出-Fibonacci sequence
Stack-and-queue-simple-Test
- 实现数据结构中关于栈与队列的基础内容，栈的内容包括顺序栈、链式栈、用栈实现斐波那契函数以及两个栈实现共享空间，队列内容包括顺序队列、链式队列-Implementation of the data structure on the stack and the contents of the queue, the contents of the stack, including the stack, chain stack, with the stack to achieve Fibonacci f
FIB
- 通过Linux多线程实现斐波那契数列，适合Linux编程入门者。(The realization of multi-threaded Linux Fibonacci sequence)
fibonacci (2)
- A recursive fibonacci code developed in linux