代码搜索:Microphone array

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

代码结果 10,000
www.eeworm.com/read/312211/13615637

cpp xhpsort.cpp

#include #include #include #include #include "nr.h" #include "print_array.h" using namespace std; // Driver for routine hpsort int main(void) {
www.eeworm.com/read/312211/13615680

cpp xsort.cpp

#include #include #include #include #include "nr.h" #include "print_array.h" using namespace std; // Driver for routine sort int main(void) {
www.eeworm.com/read/308442/13701077

c sum_2d.c

#include long sum_array(int array[], int elements) { long sum = 0; int i; for (i = 0; i < elements; i++) sum += array[i]; return(sum); } void main(voi
www.eeworm.com/read/308442/13701123

c hugeint.c

#include #include void main (void) { long int i; int huge *big_array; if ((big_array = (int huge *) halloc (100000L, sizeof(long int))) == NULL)
www.eeworm.com/read/307675/13717553

cpp wangxu.cpp

#include #include #include #include #include"wangxu.h" using namespace std; void main() { int count; int array1[250],array2[250],array3[250],array4[250],a
www.eeworm.com/read/302877/13825478

c string_lib.c

/****************************************************************************** Filename: string_lib.c Target: cc2430 Revised: 16/12-2005 Revision: 1.0 Description: ****
www.eeworm.com/read/301198/13863869

c sum_2d.c

#include long sum_array(int array[], int elements) { long sum = 0; int i; for (i = 0; i < elements; i++) sum += array[i]; return(sum); } void main(voi
www.eeworm.com/read/301198/13863915

c hugeint.c

#include #include void main (void) { long int i; int huge *big_array; if ((big_array = (int huge *) halloc (100000L, sizeof(long int))) == NULL)
www.eeworm.com/read/150372/5693585

c adi_b2.c

/* ADI_B2.C - Module that shows new features in the ADuC B2 device*/ #include #include #include #include #ifdef MONITOR51 /
www.eeworm.com/read/150221/5694149

m cellsort.m

function [result, index] = cellsort(x) % tstool/cellsort % sort an cell-array x of strings % result is an cell array containing the strings in ascending order % index contains the permutation order