代码搜索：Microphone array
找到约 10,000 项符合「Microphone array」的源代码
代码结果 10,000
www.eeworm.com/read/300886/13883553
m bounded_array.m
function [x,ier]=bounded_array(x,lowerx,upperx)
% Modify array "x" in such a way that its entries do not exceed "upperx"
% and are not below "lowerx".
%
% Written by: E. Rietsch: October 21, 2006
www.eeworm.com/read/149433/5699914
txt fib_array.txt
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 0 0 0 0 0
www.eeworm.com/read/149433/5699915
java fib_array.java
public class Fib_array
{
public static void main(String args[])
{
final int SIZE = 25;
int fib[] = new int [SIZE];
int i,n=20;
fib[0]=0;
fib[1]
www.eeworm.com/read/149433/5699918
java prime_array.java
public class Prime_array
{
public static void main(String args[])
{
final int MAX=100,SIZE=30;
int prime[] = new int [SIZE];
int i,j,k,n;
prime[0]=2;
www.eeworm.com/read/149433/5699919
txt prime_array.txt
All primes in 2..100 are:
2 3 5 7 11 13 17 19 23 29
31 37 41 43 47 53 59 61 67 71
73 79 83 89 97 0 0 0 0 0
n=25
www.eeworm.com/read/149098/5703438
cpp mask_array.cpp
/**************************************************************************
*
* mask_array.cpp -- Mask array examples
* See Class Reference Section
*
*********************
www.eeworm.com/read/149098/5703457
cpp slice_array.cpp
/**************************************************************************
*
* slice_array.cpp -- Valarray slice array examples
* See Class Reference Section
*
*********
www.eeworm.com/read/149098/5703504
cpp gslice_array.cpp
/**************************************************************************
*
* gslice_array.cpp -- Generalized array slice examples
* See Class Reference Section
*
****
www.eeworm.com/read/149098/5703529
cpp indirect_array.cpp
/**************************************************************************
*
* indirect_array.cpp -- Indirect array examples
* See Class Reference Section
*
*********
www.eeworm.com/read/148721/5709258
1bk array.1bk
0 1 2 3 1000 1001 1002 1003 2000 2001 2002 2003
0 1 2 3 1000 1001 1002 1003 2000 2001 2002 2003
0 1 2 3 1000 1001 1002 1003 2000 2001 2002 2003
0 1 2 3 1000 1001 1002 1003 2000 2001 2002 2003