-
8051单片机的A/D 2500,128X64点阵LCD的演示程序
8051 a/D2500,lcd 128x64演示程序
- 2022-09-19 10:15:03下载
- 积分:1
-
stdcall C++ 调用汇编理解。让我们知道函数参数入栈及返回的处理。对比fastcall会更清楚。...
stdcall C++ 调用汇编理解。让我们知道函数参数入栈及返回的处理。对比fastcall会更清楚。-stdcall C++ compilation of understanding calls. Let us know the function parameters and return stack processing. Contrast fastcall will be clearer.
- 2023-06-22 09:25:02下载
- 积分:1
-
Fortran 的矩阵求逆程序
Fortran 的矩阵求逆程序-Fortran the matrix inversion process
- 2022-02-19 21:43:19下载
- 积分:1
-
Tiger语言编译器
Tiger语言编译器-Tiger language compiler
- 2022-12-11 04:20:03下载
- 积分:1
-
这是用汇编语言编写的关于十进制表达式的程序!输入完表达式之后,按"="键结束输入!在我们检查的时候,老师说这个程序考虑的很周到,希望会对大家有用!...
这是用汇编语言编写的关于十进制表达式的程序!输入完表达式之后,按"="键结束输入!在我们检查的时候,老师说这个程序考虑的很周到,希望会对大家有用!-This is written in assembly language on the procedure decimal expression! End the importation of expression, according to the "=" key input end! We check the time, the teacher said this procedure is very thoughtful consideration, we would hope that useful!
- 2022-05-27 08:32:56下载
- 积分:1
-
Seeking integral product, from a C language reference, proposed a new solution t...
求整数之积,出自C语言参考,提出了一种新的解决两数之积的算法
-Seeking integral product, from a C language reference, proposed a new solution to two the number of the product algorithm
- 2022-04-06 23:39:32下载
- 积分:1
-
带界面的两位数计算器,完成加减乘除运算欢迎使用
带界面的两位数计算器,完成加减乘除运算欢迎使用-calculator
- 2023-03-26 07:35:03下载
- 积分:1
-
暴力搜索API的汇编代码,代码注释详细,一具有一般汇编功底的人都能掌握....
暴力搜索API的汇编代码,代码注释详细,一具有一般汇编功底的人都能掌握.-Violence english API assembly code, code notes in detail, one has a general compilation of people able to master the skills.
- 2022-08-07 21:02:26下载
- 积分:1
-
In 51 of the P1 port to connect eight light
在51的P1口连接8个发光2级管,实现8个发光2级管轮流显示-In 51 of the P1 port to connect eight light-emitting tube 2, the achievement of eight light-emitting display two pipe rotation
- 2023-04-02 20:55:03下载
- 积分: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