You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
148 lines
4.4 KiB
148 lines
4.4 KiB
<!DOCTYPE html>
|
|
<html lang="en">
|
|
<head>
|
|
<meta charset="UTF-8">
|
|
<title>D3</title>
|
|
|
|
<link rel="stylesheet" href="vendor/fontawesome/css/font-awesome.css">
|
|
<link rel="stylesheet" href="css/style.css">
|
|
</head>
|
|
<body>
|
|
for each one: in place? adaptive? stable? swaps. comparisons. random example. best case example. worst case example.
|
|
|
|
<h1>Quicksort discussion</h1>
|
|
used by chrome. <br>
|
|
<div class="sorter"
|
|
data-algorithm='quick'
|
|
data-stable='Maybe'
|
|
data-adaptive='Maybe'
|
|
data-worst-perf='O(n + m + 3k)'
|
|
data-avg-perf='O(n + m + 3k)'
|
|
data-best-perf='O(n + m + 3k)'
|
|
data-worst-memory='0 (in place)'
|
|
></div>
|
|
|
|
|
|
<h1>Mergesort discussion</h1>
|
|
used by firefox and safari. <br>
|
|
helpful: http://stackoverflow.com/questions/2967153/space-requirements-of-a-merge-sort<br>
|
|
<div class="sorter"
|
|
data-algorithm='merge'
|
|
data-stable='Maybe'
|
|
data-adaptive='Maybe'
|
|
data-worst-perf='O(n + m + 3k)'
|
|
data-avg-perf='O(n + m + 3k)'
|
|
data-best-perf='O(n + m + 3k)'
|
|
data-worst-memory='0 (in place)'
|
|
></div>
|
|
|
|
|
|
<h1>Shellsort discussion</h1>
|
|
several ways to pick gap width, but dependence on input data makes gap selection trivial. <br>
|
|
<div class="sorter"
|
|
data-algorithm='shell'
|
|
data-stable='Maybe'
|
|
data-adaptive='Maybe'
|
|
data-worst-perf='O(n + m + 3k)'
|
|
data-avg-perf='O(n + m + 3k)'
|
|
data-best-perf='O(n + m + 3k)'
|
|
data-worst-memory='0 (in place)'
|
|
></div>
|
|
|
|
<h1>Selection sort discussion</h1>
|
|
http://stackoverflow.com/questions/15799034/insertion-sort-vs-selection-sort <br>
|
|
swap. highlight. fade.
|
|
<div class="sorter"
|
|
data-algorithm='selection'
|
|
data-stable='Maybe'
|
|
data-adaptive='Maybe'
|
|
data-worst-perf='O(n + m + 3k)'
|
|
data-avg-perf='O(n + m + 3k)'
|
|
data-best-perf='O(n + m + 3k)'
|
|
data-worst-memory='0 (in place)'>
|
|
</div>
|
|
|
|
<h1>insertion sort discussion</h1>
|
|
how is this different from bubble and selection. <br>
|
|
swap. highlight. fade.
|
|
<div class="sorter"
|
|
data-algorithm='insertion'
|
|
data-stable='Maybe'
|
|
data-adaptive='Maybe'
|
|
data-worst-perf='O(n + m + 3k)'
|
|
data-avg-perf='O(n + m + 3k)'
|
|
data-best-perf='O(n + m + 3k)'
|
|
data-worst-memory='0 (in place)'
|
|
></div>
|
|
|
|
|
|
<h1>bubble sort discussion</h1>
|
|
how is this different from insertion and selection sorts. <br>
|
|
swap. highlight. fade.
|
|
<div class="sorter"
|
|
data-algorithm='bubble'
|
|
data-stable='Maybe'
|
|
data-adaptive='Maybe'
|
|
data-worst-perf='O(n + m + 3k)'
|
|
data-avg-perf='O(n + m + 3k)'
|
|
data-best-perf='O(n + m + 3k)'
|
|
data-worst-memory='0 (in place)'
|
|
></div>
|
|
|
|
<!--
|
|
<h1>radix sort discussion</h1>
|
|
|
|
<div class="sorter" data-algorithm='radix'></div>
|
|
|
|
<!--
|
|
<h1>Heapsort discussion</h1>
|
|
|
|
<div class="sorter"></div>
|
|
|
|
<h1>Bubblesort discussion</h1>
|
|
NOTE http://stackoverflow.com/questions/17270628/insertion-sort-vs-bubble-sort-algorithms
|
|
<div class="sorter"></div>
|
|
|
|
<h1>Radixsort discussion</h1>
|
|
|
|
<div class="sorter"></div>
|
|
-->
|
|
|
|
|
|
<script type='text/javascript' src='vendor/d3/d3.min.js'></script>
|
|
<script type='text/javascript' src='js/visualizer.js'></script>
|
|
<script type='text/javascript' src='js/itemgroup.js'></script>
|
|
<script type='text/javascript' src='js/visualizer-dom.js'></script>
|
|
<script type='text/javascript' src='js/sorter.js'></script>
|
|
<script type='text/javascript' src='js/quicksort.js'></script>
|
|
<script type='text/javascript' src='js/mergesort.js'></script>
|
|
<script type='text/javascript' src='js/insertionsort.js'></script>
|
|
<script type='text/javascript' src='js/shellsort.js'></script>
|
|
<script type='text/javascript' src='js/selectionsort.js'></script>
|
|
<script type='text/javascript' src='js/bubblesort.js'></script>
|
|
<script type='text/javascript' src='js/radixsort.js'></script>
|
|
|
|
<script type='text/javascript'>
|
|
var dump = function(arr) {
|
|
var d = [];
|
|
arr.forEach(function(obj) {
|
|
d.push(obj.value);
|
|
})
|
|
|
|
return d.join(',');
|
|
};
|
|
|
|
|
|
// Wrap anonymous function to avoid polluting global namespace.
|
|
(function() {
|
|
var elements = document.querySelectorAll('.sorter');
|
|
var V;
|
|
for (key in elements) {
|
|
if (elements.hasOwnProperty(key)) {
|
|
new Visualizer(elements[key]);
|
|
}
|
|
}
|
|
})();
|
|
</script>
|
|
</body>
|
|
</html>
|
|
|