User contributions for Jschleic
From Alda
Jump to navigationJump to search
18 August 2010
- 16:2416:24, 18 August 2010 diff hist 0 m Sortieren →Datenspeicherung: typo
14 August 2010
- 08:2208:22, 14 August 2010 diff hist −41 m Randomisierte Algorithmen →1. Randomisierte Algorithmen: Formet
12 August 2010
- 17:2917:29, 12 August 2010 diff hist +5 m Graphen und Graphenalgorithmen →Stirling'sche Formel: typo
- 10:0610:06, 12 August 2010 diff hist +100 Graphen und Graphenalgorithmen bäume zu Definitionen, einige Typos und Codekorrekturen
- 08:5108:51, 12 August 2010 diff hist +1 m Graphen und Graphenalgorithmen →Definitionen: typo
10 August 2010
- 16:0616:06, 10 August 2010 diff hist +1 m Hashing und assoziative Arrays →Implementation: typo
- 15:5715:57, 10 August 2010 diff hist −1 m Hashing und assoziative Arrays →Komplexität der linearen Verkettung und Wahl der Kapazität: typo
- 15:4615:46, 10 August 2010 diff hist 0 m Hashing und assoziative Arrays →Realisierung des assoziativen Arrays als Suchbaum: typo
- 13:2313:23, 10 August 2010 diff hist 0 m Effizienz →Optimierung der Laufzeit: typo
- 13:1813:18, 10 August 2010 diff hist +4 m Effizienz →Optimierung der Laufzeit: quadrat. Gleichung
- 13:1213:12, 10 August 2010 diff hist +1 m Korrektheit →Prinzipien für die Generierung von Testdaten: typo
- 12:0512:05, 10 August 2010 diff hist 0 m Korrektheit →Vergleich formaler Korrektheitsbeweis und Testen: Satzbau + typo
24 September 2008
- 11:4811:48, 24 September 2008 diff hist +8,334 Main Page Undo revision 4422 by 87.118.120.241 (Talk) spam
22 July 2008
- 14:4414:44, 22 July 2008 diff hist −1 m Suchen →Komplexitätsanalyse
- 13:5413:54, 22 July 2008 diff hist −3 m Sortieren →Charakterisierung der Effizienz von Algorithmen
- 13:5313:53, 22 July 2008 diff hist −9 m Sortieren →Mengentheoretische Anforderungen: Formeln verschönert
- 11:4411:44, 22 July 2008 diff hist +47 Greedy-Algorithmen und Dynamische Programmierung →Dynamische Programmierung: Programmierung <-> Optimierung
- 11:4111:41, 22 July 2008 diff hist +64 m Greedy-Algorithmen und Dynamische Programmierung →Problemlösung durch einen Entscheidungsbaum: Link korrigiert
- 11:3511:35, 22 July 2008 diff hist +2 m Randomisierte Algorithmen →Mersenne Twister
- 10:2610:26, 22 July 2008 diff hist +163 m Container →Beispiele: Gliederung
- 10:1410:14, 22 July 2008 diff hist +1 m Container Gliederung
- 10:0310:03, 22 July 2008 diff hist −1 m Effizienz typo
- 10:0210:02, 22 July 2008 diff hist 0 m Korrektheit typo
- 09:5909:59, 22 July 2008 diff hist +1 m Korrektheit typos
- 09:5509:55, 22 July 2008 diff hist +13 m Sortieren typos
- 09:4909:49, 22 July 2008 diff hist +4 Einführung →Definition von Datenstrukturen: typos
21 July 2008
- 12:0812:08, 21 July 2008 diff hist +28 Iteration versus Rekursion →Version 1: Naive rekursive Implementation: Grafik eigefügt
- 12:0612:06, 21 July 2008 diff hist +49 N File:Fibrek.jpg Baumrekursion zur Berechnung der Fibonacci-Zahlen current
- 12:0412:04, 21 July 2008 diff hist 0 File:Fibrek.png uploaded a new version of "Image:Fibrek.png" current
- 11:5511:55, 21 July 2008 diff hist +49 N File:Fibrek.png Baum zur rekursiven Berechnung ein Fibonacci-Zahl
26 June 2008
- 13:4613:46, 26 June 2008 diff hist +826 Generizität →Iteratoren
- 13:2913:29, 26 June 2008 diff hist +434 Generizität →Beispiel => Motivation: Verbesserung der Gliederung
25 June 2008
- 23:4423:44, 25 June 2008 diff hist +42 m Graphen und Graphenalgorithmen →Minimaler Spannbaum (tree-MST): formeln verbessert
- 23:4223:42, 25 June 2008 diff hist −4 m Graphen und Graphenalgorithmen →Algorithmus von Krushal: nummerierung
- 23:4123:41, 25 June 2008 diff hist +74 m Graphen und Graphenalgorithmen →Problem des Handlungsreisenden (travelling salesman problem - TSP): typo
- 23:4023:40, 25 June 2008 diff hist 0 m Prioritätswarteschlangen →Prioritätswarteschlangen: typo
- 22:4322:43, 25 June 2008 diff hist +33 m Main Page →Übungsaufgaben
- 22:4122:41, 25 June 2008 diff hist +245 Main Page →Übungsaufgaben: Neue entfernungen.txt - im Original waren falsche Koordinaten bei Pforzheim und Oldenburg drin
- 22:3322:33, 25 June 2008 diff hist +2,654 Graphen und Graphenalgorithmen heutige Vorlesung (25.06.) vorläufig nicht-autorisiert hinzugefügt - Bitte vom Wiki-Beauftragten ergänzen / ersetzen!
- 22:0622:06, 25 June 2008 diff hist +381 m Graphen und Graphenalgorithmen →Vereinfachte Lösung für den acyclic-Algorithmus
- 22:0322:03, 25 June 2008 diff hist −2,389 Graphen und Graphenalgorithmen →Detektion von Zyklen: fehlerhafter Code entfernt, funktionierender acyclic(graph) siehe unten
- 10:0810:08, 25 June 2008 diff hist +610 Graphen und Graphenalgorithmen →Detektion von Zyklen: acyclic2
23 June 2008
- 22:0822:08, 23 June 2008 diff hist +125 Sandbox test TeX
20 June 2008
- 14:1614:16, 20 June 2008 diff hist −1 m Sortieren →a.1) Algorithmus c ← merge(a,b): Code als ein block
17 June 2008
- 09:5609:56, 17 June 2008 diff hist +27 Generizität Gliederung des Artikels
28 May 2008
- 11:4411:44, 28 May 2008 diff hist +11 m Prioritätswarteschlangen →Heap: Größe der Grafik geändert
- 11:4011:40, 28 May 2008 diff hist +359 Prioritätswarteschlangen heap - first edit
- 11:3411:34, 28 May 2008 diff hist +99 N File:HeapArray.png Man kann einen Heap-Baum als Array abspeichern, indem man die Elemente wie gezeigt durchnummeriert. current
