代码搜索：Power

找到约 10,000 项符合「Power」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/204559/15336889

c ch03.01.c

// iostream.h is preStandard form // #include #include /** ** 2 raised to the power of 10: 1024 **/ int main() { // a first solution cout
·
www.eeworm.com/read/203855/15350845

m ofdmwaterfilling.m

function [shanonCapacity powerAllocated] = ofdmwaterfilling(... nSubChannel,totalPower,channelStateInformation,bandwidth,noiseDensity); % %======================================================
·
www.eeworm.com/read/203081/15365613

h pcu.h

/******************** (C) COPYRIGHT 2003 STMicroelectronics ******************** * File Name : pcu.h * Author : MCD Application Team * Date First Issued : 30/05/2003 * Descri
·
www.eeworm.com/read/202788/15372879

m ip_01_08.m

% MATLAB script for Illustrartive Problem 8, Chapter 1. ts=0.001; fs=1/ts; t=[0:ts:10]; x=cos(2*pi*47*t)+cos(2*pi*219*t)
·
www.eeworm.com/read/201202/15413471

sci dyadlength.sci

function [n,J] = dyadlength(x) // dyadlength -- Find length and dyadic length of array // Usage // [n,J] = dyadlength(x) // Inputs // x array of length n = 2^J (hopefully) // Outputs
·
www.eeworm.com/read/201202/15413573

sci quadlength.sci

function [n,J] = quadlength(x) // quadlength -- Find length and dyadic length of square matrix // Usage // [n,J] = quadlength(x) // Inputs // x 2-d image; size(n,n), n = 2^J (hopefully)
·
www.eeworm.com/read/201037/15417957

h radixsort.h

#include "LinQueue.h" void RadixSort(DataType a[], int n, int m, int d) //对对象a[0]--a[n-1]进行关键码为m位d进制整型数值的基数排序 //桶采用链式队列结构 { int i, j, k, power = 1; LinQueue *tub = new LinQueue
·
www.eeworm.com/read/201037/15417962

cpp lradixsort.cpp

void RadixSort2(elemtype x[], int n, int m) /*对记录x[0]--x[n-1]进行关键字为m位整型值的基数排序*/ /*桶结构为链式存储结构*/ { int i,j,k,l,Power; radixnode *p, *q; radixtype Head[10]; Power=1; /*进行m次排序*/
·
www.eeworm.com/read/201037/15417974

cpp radixsort.cpp

#include #include "datatype.h" #include "LinQueue.h" void RadixSort(datatype a[], int n, int m, int d) //对对象a[0]--a[n-1]进行关键码为m位d进制整型数值的基数排序 //桶采用链式队列结构 { int i, j, k, l, power
·
www.eeworm.com/read/113242/15466754

c show_pow.c

#include #include void main (void) { int power; for (power = -2; power
·