-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
62 lines (50 loc) · 2.56 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
<!DOCTYPE html>
<html>
<head>
<title>Algorithm and Complexity</title>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=yes">
<link rel="stylesheet" href="main.css">
<link rel="stylesheet" href="/path/to/styles/default.css">
<script src="/path/to/highlight.pack.js"></script>
<script>hljs.initHighlightingOnLoad();</script>
</head>
<body>
<div id="links">
<a class="social facebook" href="https://web.facebook.com/profile.php?id=100011177262846&_rdr"><img src="images/facebook.png"></a>
<a class="social vk" href="#"><img src="images/vk.png"></a>
<a class="social twitter" href="#"><img src="images/twitter.png"></a>
</div>
<div id="main">
<div id="nav">
<ul>
<li><a href="index.html" style="color:red;">Main •</a></li>
<li><a href="myvector.html">MyVector •</a></li>
<li><a href="bubble.html">Bubble Sort •</a></li>
<li><a href="merge.html">Merge Sort •</a></li>
<li><a href="insert.html">Insert Sort •</a></li>
<li><a href="quick.html">Quick Sort •</a></li>
<li><a href="graphs.html" >Graphs •</a></li>
<li><a href="olsen.html">Olsen Gang</a></li>
</ul>
</div>
<div id="border"></div>
<div id="content">
<div id="photo"><img src="images/main.jpg"></div>
<h2>Task 1 (dangerous minds)</h2>
<p>Implement your own version of C++ vector - the SCA. This could be implemented just for integers.
Your implementation should include functions for read and write access of elements,
appending, resizing (truncating if downsizing), deletion of one are a segment of elements.
Test its accumulated running times for a large sequence of operations. Compare it with the same test for C++ vector.</p>
<h2>Task 2 (ordnung must sein)</h2>
<p>a) Implement: bubble sort, insertion sort, merge sort, quicksort. Test and compare their running times
for a number of small (ca. 5-50) and large input sizes. Carefully choose (or even average) appropriate
inputs to make sure you are justifying the right conclusion. Include a graph with results of your
measurements for all algorithms, e.g. rttime vs. tabsize.</p>
<p>b) The Olsen Gang has obtained a file with 20000 credit card details. However, before they can sell the data
for big money they must sort the file by PIN. Find the most efficient algorithm for the job.
Empirically justify your choice. Consider all algortihms covered in the lecture.</p>
</div>
</div>
</body>
</html>