代码搜索结果

#include #include void main(void) { double pi = 3.14159265; printf("Tangent of pi is %f\n", tan(pi)); printf("Tangent of pi/4 is %f\n", tan(pi / 4.0)); }

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Figure 6.26 % K. Bell 7/25/01, 9/5/01, 11/12/01 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% clear all close all N = 11; n = (-(N-1)/2:(N-1)/2)'; us = -0.7; vs = e

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Figure 2.15 & 2.16 % Beampattern of uniformly weighted linear array % Xiaomin Lu % Updated 1/5/99 % Last updated by K. Bell 7/22/01, 10/4/01, 1/17/08 %%%%%%%%

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Figure 3.46 % Beam pattern for 4-element MRLA with uniform weighting % Xin Zhang 3/29/99 % Last updated by K. Bell 9/5/00, 7/23/01, 9/30

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Figure 3.30 % Villeneuve roots % Lillian Xu % Modified by Xin Zhang 3/24/99 % Updated by K. Bell 9/5/00 % Last updated by Lillian Xiaolan Xu 09/

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Figure 4.12 % Polar plot of uniformly weighted rectangular array % Xiaomin Lu 11/2/98 % Updated by K. Bell 9/29/00 % Function called: sinc, polardb %%%%%%%%%%%%%%%

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Figure 5.13 % Xiaomin Lu % Updated by K. Bell 10/13/00, 7/23/01, 10/23/01 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %distribution of eigenvalues clear all close all

最小生成树算法 (C++实现)2007-01-27 18:51这个算法,不考虑点,只考虑边及权值,抛弃了以往的邻接矩阵,邻接链表等方式 ,而是直接用数组存储,节省空间,效率更高. //======================= //优化后的最小生成树算法 //======================= #include #include

例13.2 用控制符控制输出格式。 #include #include //不要忘记包含此头文件 using namespace std; int main() {int a; couta; cout

例13.3 用流控制成员函数输出数据。 #include using namespace std; int main( ) {int a=21 cout.setf(ios::showbase);//显示基数符号(0x或0) cout