User contributions for Jschleic
From Alda
Jump to navigationJump to search
18 August 2010
- 17:2417:24, 18 August 2010 diff hist 0 m Sortieren →Datenspeicherung: typo
14 August 2010
- 09:2209:22, 14 August 2010 diff hist −41 m Randomisierte Algorithmen →1. Randomisierte Algorithmen: Formet
12 August 2010
- 18:2918:29, 12 August 2010 diff hist +5 m Graphen und Graphenalgorithmen →Stirling'sche Formel: typo
- 11:0611:06, 12 August 2010 diff hist +100 Graphen und Graphenalgorithmen bäume zu Definitionen, einige Typos und Codekorrekturen
- 09:5109:51, 12 August 2010 diff hist +1 m Graphen und Graphenalgorithmen →Definitionen: typo
10 August 2010
- 17:0617:06, 10 August 2010 diff hist +1 m Hashing und assoziative Arrays →Implementation: typo
- 16:5716:57, 10 August 2010 diff hist −1 m Hashing und assoziative Arrays →Komplexität der linearen Verkettung und Wahl der Kapazität: typo
- 16:4616:46, 10 August 2010 diff hist 0 m Hashing und assoziative Arrays →Realisierung des assoziativen Arrays als Suchbaum: typo
- 14:2314:23, 10 August 2010 diff hist 0 m Effizienz →Optimierung der Laufzeit: typo
- 14:1814:18, 10 August 2010 diff hist +4 m Effizienz →Optimierung der Laufzeit: quadrat. Gleichung
- 14:1214:12, 10 August 2010 diff hist +1 m Korrektheit →Prinzipien für die Generierung von Testdaten: typo
- 13:0513:05, 10 August 2010 diff hist 0 m Korrektheit →Vergleich formaler Korrektheitsbeweis und Testen: Satzbau + typo
24 September 2008
- 12:4812:48, 24 September 2008 diff hist +8,334 Main Page Undo revision 4422 by 87.118.120.241 (Talk) spam
22 July 2008
- 15:4415:44, 22 July 2008 diff hist −1 m Suchen →Komplexitätsanalyse
- 14:5414:54, 22 July 2008 diff hist −3 m Sortieren →Charakterisierung der Effizienz von Algorithmen
- 14:5314:53, 22 July 2008 diff hist −9 m Sortieren →Mengentheoretische Anforderungen: Formeln verschönert
- 12:4412:44, 22 July 2008 diff hist +47 Greedy-Algorithmen und Dynamische Programmierung →Dynamische Programmierung: Programmierung <-> Optimierung
- 12:4112:41, 22 July 2008 diff hist +64 m Greedy-Algorithmen und Dynamische Programmierung →Problemlösung durch einen Entscheidungsbaum: Link korrigiert
- 12:3512:35, 22 July 2008 diff hist +2 m Randomisierte Algorithmen →Mersenne Twister
- 11:2611:26, 22 July 2008 diff hist +163 m Container →Beispiele: Gliederung
- 11:1411:14, 22 July 2008 diff hist +1 m Container Gliederung
- 11:0311:03, 22 July 2008 diff hist −1 m Effizienz typo
- 11:0211:02, 22 July 2008 diff hist 0 m Korrektheit typo
- 10:5910:59, 22 July 2008 diff hist +1 m Korrektheit typos
- 10:5510:55, 22 July 2008 diff hist +13 m Sortieren typos
- 10:4910:49, 22 July 2008 diff hist +4 Einführung →Definition von Datenstrukturen: typos
21 July 2008
- 13:0813:08, 21 July 2008 diff hist +28 Iteration versus Rekursion →Version 1: Naive rekursive Implementation: Grafik eigefügt
- 13:0613:06, 21 July 2008 diff hist +49 N File:Fibrek.jpg Baumrekursion zur Berechnung der Fibonacci-Zahlen current
- 13:0413:04, 21 July 2008 diff hist 0 File:Fibrek.png uploaded a new version of "Image:Fibrek.png" current
- 12:5512:55, 21 July 2008 diff hist +49 N File:Fibrek.png Baum zur rekursiven Berechnung ein Fibonacci-Zahl
26 June 2008
- 14:4614:46, 26 June 2008 diff hist +826 Generizität →Iteratoren
- 14:2914:29, 26 June 2008 diff hist +434 Generizität →Beispiel => Motivation: Verbesserung der Gliederung
- 00:4400:44, 26 June 2008 diff hist +42 m Graphen und Graphenalgorithmen →Minimaler Spannbaum (tree-MST): formeln verbessert
- 00:4200:42, 26 June 2008 diff hist −4 m Graphen und Graphenalgorithmen →Algorithmus von Krushal: nummerierung
- 00:4100:41, 26 June 2008 diff hist +74 m Graphen und Graphenalgorithmen →Problem des Handlungsreisenden (travelling salesman problem - TSP): typo
- 00:4000:40, 26 June 2008 diff hist 0 m Prioritätswarteschlangen →Prioritätswarteschlangen: typo
25 June 2008
- 23:4323:43, 25 June 2008 diff hist +33 m Main Page →Übungsaufgaben
- 23:4123:41, 25 June 2008 diff hist +245 Main Page →Übungsaufgaben: Neue entfernungen.txt - im Original waren falsche Koordinaten bei Pforzheim und Oldenburg drin
- 23:3323: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!
- 23:0623:06, 25 June 2008 diff hist +381 m Graphen und Graphenalgorithmen →Vereinfachte Lösung für den acyclic-Algorithmus
- 23:0323:03, 25 June 2008 diff hist −2,389 Graphen und Graphenalgorithmen →Detektion von Zyklen: fehlerhafter Code entfernt, funktionierender acyclic(graph) siehe unten
- 11:0811:08, 25 June 2008 diff hist +610 Graphen und Graphenalgorithmen →Detektion von Zyklen: acyclic2
23 June 2008
- 23:0823:08, 23 June 2008 diff hist +125 Sandbox test TeX
20 June 2008
- 15:1615:16, 20 June 2008 diff hist −1 m Sortieren →a.1) Algorithmus c ← merge(a,b): Code als ein block
17 June 2008
- 10:5610:56, 17 June 2008 diff hist +27 Generizität Gliederung des Artikels
28 May 2008
- 12:4412:44, 28 May 2008 diff hist +11 m Prioritätswarteschlangen →Heap: Größe der Grafik geändert
- 12:4012:40, 28 May 2008 diff hist +359 Prioritätswarteschlangen heap - first edit
- 12:3412: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
