搜索结果

找到约 3,972 项符合 f-i 的查询结果

数据结构 设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0<I<n,使得t[I]=I,设计一个有效算法找到这个下标。要求算法在最坏情况下的计算时间为O(logn).

设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0<I<n,使得t[I]=I,设计一个有效算法找到这个下标。要求算法在最坏情况下的计算时间为O(logn).
https://www.eeworm.com/dl/654/175385.html
下载: 88
查看: 2731

网络 F:worksip2440a board可启动u-boot-like.tar.gz F:worksip2440a board可启动u-boot-like.tar.gz

F:\work\sip\2440a board\可启动\u-boot-like.tar.gz F:\work\sip\2440a board\可启动\u-boot-like.tar.gz
https://www.eeworm.com/dl/635/176125.html
下载: 38
查看: 1067

单片机开发 单片机工业控制板,具备I/O,KEYBOARD,步进电机伺服电机等功能

单片机工业控制板,具备I/O,KEYBOARD,步进电机伺服电机等功能
https://www.eeworm.com/dl/648/176136.html
下载: 130
查看: 1062

操作系统开发 it s a lift simulator, use operating system concept call mutex to implenment a lift. I do it prefect

it s a lift simulator, use operating system concept call mutex to implenment a lift. I do it prefectly.
https://www.eeworm.com/dl/531/176534.html
下载: 105
查看: 1077

Applet This a test for upload, so that I can download files here.

This a test for upload, so that I can download files here.
https://www.eeworm.com/dl/634/176774.html
下载: 135
查看: 1060

嵌入式Linux This model is just testing an idea of MIMO, which IEEE802.11n will have. But I havo not seen the s

This model is just testing an idea of MIMO, which IEEE802.11n will have. But I havo not seen the standard, I tried to make it with 11a. Actually this model would not work in real world, because the preambles were not designed to solve the MIMO feature. But this model may be useful to get som ...
https://www.eeworm.com/dl/653/177025.html
下载: 182
查看: 1092

游戏 i am a good teacje sou id ith

i am a good teacje sou id ith
https://www.eeworm.com/dl/625/177122.html
下载: 65
查看: 1070

单片机开发 在Power-I 51 Mini开发板上

在Power-I 51 Mini开发板上,基于89C51单片机开发的数字音乐盒,可以实现上一首下一首,播放,暂停,停止,的按键功能,并有数码显示时间,开机画面和曲号。
https://www.eeworm.com/dl/648/178023.html
下载: 173
查看: 1040

其他 数据结构第一次实验。用来创建线性表和求取线性表的第i个元素。

数据结构第一次实验。用来创建线性表和求取线性表的第i个元素。
https://www.eeworm.com/dl/534/178088.html
下载: 23
查看: 1031

Java编程 简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F)

简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F),设p,q ∈K,若对于任一字符串w,由p沿w可达某终点当且仅当由q沿w可达某终点,则说p,q等价,记为p≡q。而且,≡的一个等价类恰好就是状态数最少的确定型自动机的一个状态
https://www.eeworm.com/dl/633/178098.html
下载: 126
查看: 1084