代码搜索：移相法
找到约 10,000 项符合「移相法」的源代码
代码结果 10,000
www.eeworm.com/read/441836/7664164
dsp 冒泡法改进.dsp
# Microsoft Developer Studio Project File - Name="冒泡法改进" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Con
www.eeworm.com/read/441836/7664165
plg 冒泡法改进.plg
Build Log
--------------------Configuration: 冒泡法改进 - Win32 Debug--------------------
Command Lines
Creating temporary file "C:\DOCUME~1\ADMINI~
www.eeworm.com/read/441836/7664166
opt 冒泡法改进.opt
www.eeworm.com/read/441836/7664167
cpp 冒泡法改进.cpp
//冒泡法改进
#include
#define N 10//待排序数据个数
void main()
{
int a[N];//定义一个一维整型数组a
int i,j,temp;//定义循环变量和临时变量
printf("Please input 10 integers：\n");
for(i=0;i
www.eeworm.com/read/441836/7664168
obj 冒泡法改进.obj
www.eeworm.com/read/441836/7664170
ncb 冒泡法改进.ncb
www.eeworm.com/read/439439/7708878
cpp 迭代法.cpp
#include
#include
#include
using namespace std;
int main()
{
int exact;
cout
www.eeworm.com/read/437701/7742672
pdf 记忆法.pdf
www.eeworm.com/read/437445/7747852
c 编码法剪裁.c
#include "stdio.h"
#include "stdlib.h"
#include "graphics.h"
#define X 200
#define Y 200
#define LEFT 1
#define RIGHT 2
#define BOTTOM 4
#define TOP 8
int color=WHITE;
#define XL 25
#define
www.eeworm.com/read/298817/7933196
c 冒泡法改进.c
/* 冒泡法是数据排序的一种基本算法,它的基本方法是:相邻两元素进行比较,如有需要则进行交换,
每完成一次循环就将最小元素排在最后(如从大到小排序),下一次循环是将其他的数进行类似操作?
如将N 个数按从大到小排序,Turbo C语言程序函数
如下: */
void sort(int a[],int n);