程序设计基础知识回顾_第1页
程序设计基础知识回顾_第2页
程序设计基础知识回顾_第3页
程序设计基础知识回顾_第4页
程序设计基础知识回顾_第5页
已阅读5页,还剩38页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

程序设计基础知识回顾第一章概述冯•诺依曼体系结构虚拟机程序设计步骤C++程序的运行步骤第二章基本数据类型和表达式数据类型:规定了值集和操作集。静态类型语言和动态类型语言强类型语言和弱类型语言基本数据类型对应机器指令能直接处理的数据符号常量的重要性变量与冯•诺依曼体系结构的关系操作数的类型转换操作符的优先级和结合性表达式的副作用:(++x)*(x+1)第三章程序的流程控制顺序、选择、重复(循环)、无条件转移循环:在一组变量上重复执行一段程序,又称为“迭代”。循环初始化循环条件循环体下一次循环准备循环优化结构化程序设计const

intN=10;int

a[N];把a中从位置m开始往后的所有元素向前或向后移动一个位置,移出的元素扔掉,空出的位置填0。第四章过程抽象--函数功能分解与复合子程序过程抽象参数传递局部变量与全局变量标识符的作用域与变量的生存期递归函数“分而治之”程序设计与循环(迭代)的区别内联函数、默认参数值、函数名重载函数库C++条件编译第五章构造数据类型枚举类型数组类型一维字符数组--字符串类型结构类型联合类型指针类型(作用)引用类型(作用)void

f(int*p){

......int

m;p=&m;//OK,...*p...//通过p可以访问实参以外的数据}void

g(int

&x){int

m;......x

=&m;

//Errorx=m;//把实参的值改成m,即通过x只能访问实参}int

main(){

int

a;f(&a);g(a);}void

f(int

*const

p){

......int

m;p=

&m;

//Error,...*p...//通过p只能访问实参}const用于指针和引用类型的参数中:f(const

int

*p);*p=1;//不可以f(int

*

const

p);intx;p=&x;//不可以f(const

int

*

const

p);intx;p=&x;//不可以*p=1;//不可以f(const

int

&x);inty;x=&y;//不可以x=1;//不可以int

fib(int

n){

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=3{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=3{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=2{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=3{

if

(n==1

||

n==2)return

1;else

1return

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=3{

if

(n==1

||

n==2)return

1;else

1return

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=1{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=3{

if

(n==1

||

n==2)return

1;else

1

1return

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;else

2return

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;else

2return

fib(n-1)+fib(n-2);fib(4);}int

fib(int

n)

//n=2{

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}int

fib(int

n)

//n=4{

if

(n==1

||

n==2)return

1;else

21return

fib(n-1)+fib(n-2);}fib(4);int

fib(int

n){

if

(n==1

||

n==2)return

1;elsereturn

fib(n-1)+fib(n-2);}3fib(4);void

hanoi(char

x,char

y,char

z,int

n){ if

(n

==

1)cout

<<

"1:

"<<

x

<<"→"<<y

<<

endl;else{

hanoi(x,z,y,n-1);cout<<n<<":

"<<

x

<<"→"<<

y

<<endl;hanoi(z,y,x,n-1);}}hanoi('A','B','C',3);void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}hanoi('A','B','C',3);}void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

Cvoid

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

Cvoid

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//B,C,A,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C}void

hanoi(char

x,char

y,char

z,int

n)

//B,C,A,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,C,B,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

Cvoid

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

Cvoid

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//C,A,B,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

B1:C

Avoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//C,A,B,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

B1:C

Avoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

B1:C

A2:C

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

B1:C

A2:C

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,1{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}void

hanoi(char

x,char

y,char

z,int

n)

//A,B,C,3{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout<<n<<":"<<

x

<<"→"<<y

<<

endl;hanoi(z,y,x,n-1);

}}hanoi('A','B','C',3);1:A→

B2:A→

C1:B

C3:A→

B1:C

A2:C

B1:A→

Bvoid

hanoi(char

x,char

y,char

z,int

n)

//C,B,A,2{ if

(n==1)cout<<"1:

"<<

x<<"→"<<

y

<<

endl;else

{hanoi(x,z,y,n-1);cout

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论