资源列表
[单片机(51,AVR,MSP430等)] 5_3
说明：按下16个矩阵键盘依次在数码管上显示1-16的平方。如按下第一个显示1，第二个显示4... -the display of nixie tube<郑峰> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[VHDL编程] 35_bit_pack
说明：hiiiiiSystem will automatically delete the directory of debug and release, so please do not put files on these two directory<Puneet> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[单片机(51,AVR,MSP430等)] nixie-tube
说明：数码管前三位显示一个跑表，从000到999之间以1 秒速度运行，当按下一个独立键盘时跑表停止，松开手后跑表继续运行。(用定时器设计表)-the function about nixie tube<郑峰> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[单片机(51,AVR,MSP430等)] cong
说明：利用动态扫描和定时器1在数码管上显示出从765432开始以1/10秒的速度往下递减直至765398并保持显示此数，与此同时利用定时器0以500MS速度进行流水灯从上至下移动，当数码管上数减到停止时，实验板上流水灯也停止然后全部开始闪烁，3秒后（用T0定时）流水灯全部关闭、数码管上显示出“HELLO”。到此保持住。 -nixie tube<郑峰> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[matlab例程] Untitled2
说明：In this programe a highly scattered enviroment is considered. The Capacity of a MIMO channel with nt transmit antenna and nr recieve antenna is analyzed.capacity of MIMO the result dependences Capacity (bit/s/Hz), and the SNR (dB), in this simulation<Rafal> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[数值算法/人工智能] doublinklist
说明：Double linked list- a doubly-linked list is a linked data structure that consists of a set of sequentially-linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the seque<irisrd> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[Windows编程] liklistinsert
说明：a linked list (or more clearly, "singly-linked list") is a data structure that consists of a sequence of nodes each of which contains a reference (i.e., a link) to the next node in the sequence.<irisrd> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[Windows编程] Quick-sort
说明：Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists. The steps are: Pick an element, called a pivot, from the list. Reorder the list so that all elements with values less than the pivot come before the<irisrd> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[数值算法/人工智能] bubble
说明：Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity,<irisrd> 在 2025-07-27 上传 | 大小：1kb | 下载：0
[数值算法/人工智能] insertion
说明：Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort<irisrd> 在 2025-07-27 上传 | 大小：1kb | 下载：0