-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
244 lines (152 loc) · 5.62 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
<!DOCTYPE html>
<!--[if IEMobile 7 ]><html class="no-js iem7"><![endif]-->
<!--[if lt IE 9]><html class="no-js lte-ie8"><![endif]-->
<!--[if (gt IE 8)|(gt IEMobile 7)|!(IEMobile)|!(IE)]><!--><html class="no-js" lang="en"><!--<![endif]-->
<head>
<meta charset="utf-8">
<title>My Octopress Blog</title>
<meta name="author" content="Your Name">
<meta name="description" content="MathJax.Hub.Config({
tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']]}
}); layout: post
title: “算法导论—第二章习题”
date: 2014-05-11 18:04 …">
<!-- http://t.co/dKP3o1e -->
<meta name="HandheldFriendly" content="True">
<meta name="MobileOptimized" content="320">
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="canonical" href="http://whf881211.github.io">
<link href="/favicon.png" rel="icon">
<link href="/stylesheets/screen.css" media="screen, projection" rel="stylesheet" type="text/css">
<link href="/atom.xml" rel="alternate" title="My Octopress Blog" type="application/atom+xml">
<script src="/javascripts/modernizr-2.0.js"></script>
<script src="//ajax.googleapis.com/ajax/libs/jquery/1.9.1/jquery.min.js"></script>
<script>!window.jQuery && document.write(unescape('%3Cscript src="./javascripts/libs/jquery.min.js"%3E%3C/script%3E'))</script>
<script src="/javascripts/octopress.js" type="text/javascript"></script>
<!--Fonts from Google"s Web font directory at http://google.com/webfonts -->
<link href="//fonts.googleapis.com/css?family=PT+Serif:regular,italic,bold,bolditalic" rel="stylesheet" type="text/css">
<link href="//fonts.googleapis.com/css?family=PT+Sans:regular,italic,bold,bolditalic" rel="stylesheet" type="text/css">
</head>
<body >
<header role="banner"><hgroup>
<h1><a href="/">My Octopress Blog</a></h1>
<h2>A blogging framework for hackers.</h2>
</hgroup>
</header>
<nav role="navigation"><ul class="subscription" data-subscription="rss">
<li><a href="/atom.xml" rel="subscribe-rss" title="subscribe via RSS">RSS</a></li>
</ul>
<form action="https://www.google.com/search" method="get">
<fieldset role="search">
<input type="hidden" name="q" value="site:whf881211.github.io" />
<input class="search" type="text" name="q" results="0" placeholder="Search"/>
</fieldset>
</form>
<ul class="main-navigation">
<li><a href="/">Blog</a></li>
<li><a href="/blog/archives">Archives</a></li>
</ul>
</nav>
<div id="main">
<div id="content">
<div class="blog-index">
<article>
<header>
<h1 class="entry-title"><a href="/blog/2014/05/11/di-%5B%3F%5D-pian-wen-zhang/">Di [?] Pian Wen Zhang</a></h1>
<p class="meta">
<time datetime="2014-05-11T00:00:00+08:00" pubdate data-updated="true"></time>
</p>
</header>
<div class="entry-content"><script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {inlineMath: [['$','$'], ['\\(','\\)']]}
});
</script>
<hr />
<p>layout: post
title: “算法导论—第二章习题”
date: 2014-05-11 18:04:00 +0800
comments: true</p>
<h2>categories: </h2>
<p><strong>2.1-2 重写过程INSERTION-SORT,使之按非升序（而不是按非降序）排序。</strong></p>
<p>对数组A进行非升序排序：</p>
<pre><code>void InsertionSort(int[] Unsorted, int size)
{
for(j = 2; j < size; j++ )
{
int key = Unsorted[j];
int i = j -1;
while(i > 0 && Unsored[i] < key)
{
Unsorted[i+1] = Unsotred[i];
i = i-1;
}
Unsorted[i+1] = key;
}
}
</code></pre>
<p><strong>2.2-1 用$\theta$形式表示对函数$n<sup>3</sup>/1000-100n<sup>2</sup>-100n+3$.</strong></p>
<p>答：$\theta(3)$</p>
<p><strong>2.2-2写出选择排序的代码，以及它的最佳和最坏情况下的运行时间</strong></p>
<p>答:最佳时间$\theta(n)$. 最坏时间$\theta(n<sup>2</sup>)$.</p>
<p>选择排序代码：</p>
<pre><code>void SelectionSort(int[] Unsorted, int size)
{
for(int i =0; i < size; i++)
{
int min = Unsorted[i];
int minIndex = i;
//找到最小数
for(int j=i; j<size; j++)
{
if(Unsorted[j]<min)
{
min = Unsorted[j];
minIndex = j;
}
}
if(min_index!=i)
{
//交换最小的数和第n个数
int temp = Unsorted[i];
Unsorted[i] = Unsorted[minIndex];
Unsorted[minIndex] = temp;
}
}
}
</code></pre>
<p><strong>2.3-1以图2-4为模型，说明合并排序在输入数组A={3,41,52,26,38,57,9,49}上的执行过程.</strong></p>
</div>
</article>
<div class="pagination">
<a href="/blog/archives">Blog Archives</a>
</div>
</div>
<aside class="sidebar">
<section>
<h1>Recent Posts</h1>
<ul id="recent_posts">
<li class="post">
<a href="/blog/2014/05/11/di-%5B%3F%5D-pian-wen-zhang/">Di [?] Pian Wen Zhang</a>
</li>
</ul>
</section>
</aside>
</div>
</div>
<footer role="contentinfo"><p>
Copyright © 2014 - Your Name -
<span class="credit">Powered by <a href="http://octopress.org">Octopress</a></span>
</p>
</footer>
<script type="text/javascript">
(function(){
var twitterWidgets = document.createElement('script');
twitterWidgets.type = 'text/javascript';
twitterWidgets.async = true;
twitterWidgets.src = '//platform.twitter.com/widgets.js';
document.getElementsByTagName('head')[0].appendChild(twitterWidgets);
})();
</script>
</body>
</html>