-
verilog写的分频程序,可以对输入的频率分频
verilog写的分频程序,可以对输入的频率分频-Verilog write the sub-frequency procedures, can the frequency of the input frequency
- 2023-08-11 09:50:04下载
- 积分:1
-
一个实现交通路口红黄绿灯分别轮流亮灭的汇编语言小程序
一个实现交通路口红黄绿灯分别轮流亮灭的汇编语言小程序
- 2022-10-02 06:05:03下载
- 积分:1
-
飞利浦TEA5767HN的初步程序,还要完善
飞利浦TEA5767HN的初步程序,还要完善-the preliminary procedures, but also perfect
- 2023-08-20 16:40:03下载
- 积分:1
-
可以利用AT89C51,对模数转换IC ADS7804能够显示出其电压值
可以利用AT89C51,对模数转换IC ADS7804能够显示出其电压值-Can make use of AT89C51, for analog-digital conversion IC ADS7804 can show that its voltage value
- 2023-03-26 15:05:03下载
- 积分:1
-
湿空气参数计算
根据已知湿空气的任意2个参数计算其他参数,如已知空气干湿球温度计算焓值之类,操作简单,适合制冷专业使用。运行结果都根据nist软件比较过,比较精确。
- 2022-12-03 19:25:03下载
- 积分:1
-
有n个整数,使其前面各数顺序向后移m个位置,最后m个数变成最前面的m个数...
有n个整数,使其前面各数顺序向后移m个位置,最后m个数变成最前面的m个数
-There is a whole number n, the number of its previous order of the backward shift position m, and finally the number m of m into the top of the number of
- 2023-01-22 04:25:03下载
- 积分:1
-
Multi
多功能数字钟设计
基本要求: 1.具有时,分,秒的显示。
2.时,分可以调整。
3.使闹钟具有可整点报时与定时闹钟的功能。
-Multi-function digital clock design basic requirements: 1. With hours, minutes and seconds display. 2. Hours, minutes, can be adjusted. 3. To be the whole point timekeeping clock with alarm and timer functions.
- 2022-03-19 15:48:22下载
- 积分:1
-
转载别人ds18b20proteus作品希望对proteus library里没有ds18b20的xdjm们有用!...
转载别人ds18b20proteus作品希望对proteus library里没有ds18b20的xdjm们有用!-reproduced works ds18b20proteus others hope to proteus librar There"s no y ds18b20 the xdjm were useful!
- 2023-07-09 05:25:03下载
- 积分:1
-
这个过程我花了很长时间才写的,很好的,可以…
这个程序我花了好久才写出来的,非常的好,它可以产生很高性能的三角波,一般程序不易产生如此好的波形.-this process I have spent a long time before the writing, very good, and it can produce a very high-performance triangular wave, the general procedures have not been so good waveform.
- 2022-02-09 16:05:31下载
- 积分:1
-
#include <iostream>
#include <stack>
#define MAX_SIZE...
非递归的快速排序算法-#include
#include
#define MAX_SIZE 11
using namespace std
typedef int elem
typedef std::stack Stack
int partition(elem*pData, int low, int high)
void swap(elem& a, elem& b)
void qsort(elem* pData, int low, int high)
int partition(elem*pData, int low, int high)
{
elem key = pData[low]
while(low < high)
{
while(low < high && pData[high] >= key)
high--
swap(pData[low], pData[high])
while(low < high && pData[low]
- 2022-05-08 16:41:43下载
- 积分:1