Algorithmen und Datenstrukturen in C#:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | German |
Veröffentlicht: |
Heide
mana-Buch
2018
|
Ausgabe: | 2. überarbeitete und erweiterte Auflage |
Schriftenreihe: | mana-Buch : kurz knapp
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis Inhaltsverzeichnis |
Beschreibung: | VIII, 191 Seiten Illustrationen, Diagramme 25 cm |
ISBN: | 9783944330587 3944330587 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV044878580 | ||
003 | DE-604 | ||
005 | 20180704 | ||
007 | t | ||
008 | 180322s2018 gw a||| |||| 00||| ger d | ||
015 | |a 18,N10 |2 dnb | ||
015 | |a 18,A13 |2 dnb | ||
016 | 7 | |a 1153562898 |2 DE-101 | |
020 | |a 9783944330587 |c Broschur : EUR 19.90 (DE), EUR 20.50 (AT) |9 978-3-944330-58-7 | ||
020 | |a 3944330587 |9 3-944330-58-7 | ||
024 | 3 | |a 9783944330587 | |
035 | |a (OCoLC)1028548730 | ||
035 | |a (DE-599)DNB1153562898 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a ger | |
044 | |a gw |c XA-DE-SH | ||
049 | |a DE-860 |a DE-1051 |a DE-634 |a DE-573 |a DE-1102 |a DE-92 | ||
082 | 0 | |a 005.133 |2 22/ger | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
084 | |a 004 |2 sdnb | ||
100 | 1 | |a Cordts, Sönke |e Verfasser |0 (DE-588)12355103X |4 aut | |
245 | 1 | 0 | |a Algorithmen und Datenstrukturen in C# |c Sönke Cordts, Maren Nasutta |
246 | 1 | 3 | |a Algorithmen und Datenstrukturen in C sharp |
250 | |a 2. überarbeitete und erweiterte Auflage | ||
264 | 1 | |a Heide |b mana-Buch |c 2018 | |
300 | |a VIII, 191 Seiten |b Illustrationen, Diagramme |c 25 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a mana-Buch : kurz knapp | |
650 | 0 | 7 | |a C sharp |0 (DE-588)4616843-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
653 | |a Algorithmen | ||
653 | |a C[#] | ||
653 | |a Datenstrukturen | ||
689 | 0 | 0 | |a C sharp |0 (DE-588)4616843-6 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 2 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Nasutta, Maren |e Verfasser |0 (DE-588)1033817260 |4 aut | |
710 | 2 | |a mana-Buch |0 (DE-588)1065098979 |4 pbl | |
856 | 4 | 2 | |m B:DE-101 |q application/pdf |u http://d-nb.info/1153562898/04 |3 Inhaltsverzeichnis |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030272862&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-030272862 |
Datensatz im Suchindex
_version_ | 1804178415025127424 |
---|---|
adam_text | INHALTSVERZEICHNIS
VORWORT...................................................................................................................V
1
EINFUEHRUNG.......................................................................................................1
1.1 DATENTYPEN, DATENSTRUKTUREN UND KLASSEN
.........................................
1
1.2 ALGORITHMEN
..........................................................................................
2
1.3 KOMPLEXITAETSVERGLEICH VON ALGORITHMEN
............................................
9
1.3.1.
BESCHREIBUNG..............................................................................
9
1.3.2. AUFGABEN
..................................................................................
14
1.4 ITERATION UND
REKURSION....................................................................15
1.4.1. BESCHREIBUNG
............................................................................
15
1.4.2. AUFGABEN
..................................................................................
18
2
DATENSTRUKTUREN...........................................................................................19
2.1
ALLGEMEIN.............................................................................................19
2.2
LIST........................................................................................................21
2.2.1
BESCHREIBUNG............................................................................
21
2.2.2
IMPLEMENTIERUNG.....................................................................
21
2.2.3 AUFGABEN
.........
:.......................................................................52
2.3
STACK....................................................................................................
55
2.3.1
BESCHREIBUNG............................................................................
55
2.3.2 IMPLEMENTIERUNG
.....................................................................
56
2.3.3
AUFGABEN..................................................................................
68
2.4
QUEUE..................................................................................................71
2.4.1
BESCHREIBUNG............................................................................
71
2.4.2
IMPLEMENTIERUNG.....................................................................
72
2.4.3
AUFGABEN..................................................................................
84
2.5
HASHTABELLEN.......................................................................................
85
2.5.1
BESCHREIBUNG............................................................................
85
2.5.2 IMPLEMENTIERUNG
.....................................................................
90
2.5.3
AUFGABEN................................................................................
109
VIII
2.6 BINARY
TREE........................................................................................
109
2.6.1 BESCHREIBUNG
..........................................................................
109
2.6.2 IMPLEMENTIERUNG
...................................................................
114
2.6.3
AUFGABEN................................................................................
123
2.7 RED-BLACK
TREE..................................................................................
123
2.7.1 BESCHREIBUNG
..........................................................................
123
2.7.2 IMPLEMENTIERUNG
...................................................................
127
2.7.3
AUFGABEN................................................................................
139
2.8 ANWENDUNGSEMPFEHLUNGEN ZU DATENSTRUKTUREN
.........................
139
3
ALGORITHMEN..............................................................................................141
3.1 BINAERE
SUCHE......................................................................................141
3.1.1 BESCHREIBUNG
..........................................................................
141
3.1.2 IMPLEMENTIERUNG
...................................................................
143
3.2
SORTIEREN............................................................................................148
3.2.1 BESCHREIBUNG
..........................................................................
148
3.2.2
BUBBLESORT...............................................................................150
3.2.3
INSERTIONSORT...........................................................................
153
3.2.4 QUICKSORT
................................................................................
155
3.2.5 MERGESORT
...............................................................................
160
3.2.6
BUCKETSORT...............................................................................168
3.2.7 ANWENDUNGSEMPFEHLUNGEN ZU SORTIERALGORITHMEN
..........
170
3.2.8
AUFGABEN................................................................................
171
3.3
STRING-ALGORITHMEN..........................................................................
172
3.3.1
BESCHREIBUNG..........................................................................
172
3.3.2 PHONETISCHE
CODES.................................................................172
3.3.3 APPROXIMATE STRING MATCHING ALGORITHMEN
..................
.
177
3.3.4 AUFGABEN
................................................................................
185
LITERATUR.............................................................................................................
187
SACHWORTVERZEICHNIS
169
|
any_adam_object | 1 |
author | Cordts, Sönke Nasutta, Maren |
author_GND | (DE-588)12355103X (DE-588)1033817260 |
author_facet | Cordts, Sönke Nasutta, Maren |
author_role | aut aut |
author_sort | Cordts, Sönke |
author_variant | s c sc m n mn |
building | Verbundindex |
bvnumber | BV044878580 |
classification_rvk | ST 134 ST 250 |
ctrlnum | (OCoLC)1028548730 (DE-599)DNB1153562898 |
dewey-full | 005.133 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.133 |
dewey-search | 005.133 |
dewey-sort | 15.133 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
edition | 2. überarbeitete und erweiterte Auflage |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02234nam a2200577 c 4500</leader><controlfield tag="001">BV044878580</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180704 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">180322s2018 gw a||| |||| 00||| ger d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">18,N10</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">18,A13</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1153562898</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783944330587</subfield><subfield code="c">Broschur : EUR 19.90 (DE), EUR 20.50 (AT)</subfield><subfield code="9">978-3-944330-58-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3944330587</subfield><subfield code="9">3-944330-58-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783944330587</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1028548730</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1153562898</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-SH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-860</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-1102</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.133</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cordts, Sönke</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)12355103X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmen und Datenstrukturen in C#</subfield><subfield code="c">Sönke Cordts, Maren Nasutta</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Algorithmen und Datenstrukturen in C sharp</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. überarbeitete und erweiterte Auflage</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Heide</subfield><subfield code="b">mana-Buch</subfield><subfield code="c">2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 191 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">25 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">mana-Buch : kurz knapp</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">C sharp</subfield><subfield code="0">(DE-588)4616843-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithmen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">C[#]</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Datenstrukturen</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">C sharp</subfield><subfield code="0">(DE-588)4616843-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nasutta, Maren</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1033817260</subfield><subfield code="4">aut</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">mana-Buch</subfield><subfield code="0">(DE-588)1065098979</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">B:DE-101</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://d-nb.info/1153562898/04</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030272862&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030272862</subfield></datafield></record></collection> |
id | DE-604.BV044878580 |
illustrated | Illustrated |
indexdate | 2024-07-10T08:03:36Z |
institution | BVB |
institution_GND | (DE-588)1065098979 |
isbn | 9783944330587 3944330587 |
language | German |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030272862 |
oclc_num | 1028548730 |
open_access_boolean | |
owner | DE-860 DE-1051 DE-634 DE-573 DE-1102 DE-92 |
owner_facet | DE-860 DE-1051 DE-634 DE-573 DE-1102 DE-92 |
physical | VIII, 191 Seiten Illustrationen, Diagramme 25 cm |
publishDate | 2018 |
publishDateSearch | 2018 |
publishDateSort | 2018 |
publisher | mana-Buch |
record_format | marc |
series2 | mana-Buch : kurz knapp |
spelling | Cordts, Sönke Verfasser (DE-588)12355103X aut Algorithmen und Datenstrukturen in C# Sönke Cordts, Maren Nasutta Algorithmen und Datenstrukturen in C sharp 2. überarbeitete und erweiterte Auflage Heide mana-Buch 2018 VIII, 191 Seiten Illustrationen, Diagramme 25 cm txt rdacontent n rdamedia nc rdacarrier mana-Buch : kurz knapp C sharp (DE-588)4616843-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Datenstruktur (DE-588)4011146-5 gnd rswk-swf Algorithmen C[#] Datenstrukturen C sharp (DE-588)4616843-6 s Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s DE-604 Nasutta, Maren Verfasser (DE-588)1033817260 aut mana-Buch (DE-588)1065098979 pbl B:DE-101 application/pdf http://d-nb.info/1153562898/04 Inhaltsverzeichnis DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030272862&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Cordts, Sönke Nasutta, Maren Algorithmen und Datenstrukturen in C# C sharp (DE-588)4616843-6 gnd Algorithmus (DE-588)4001183-5 gnd Datenstruktur (DE-588)4011146-5 gnd |
subject_GND | (DE-588)4616843-6 (DE-588)4001183-5 (DE-588)4011146-5 |
title | Algorithmen und Datenstrukturen in C# |
title_alt | Algorithmen und Datenstrukturen in C sharp |
title_auth | Algorithmen und Datenstrukturen in C# |
title_exact_search | Algorithmen und Datenstrukturen in C# |
title_full | Algorithmen und Datenstrukturen in C# Sönke Cordts, Maren Nasutta |
title_fullStr | Algorithmen und Datenstrukturen in C# Sönke Cordts, Maren Nasutta |
title_full_unstemmed | Algorithmen und Datenstrukturen in C# Sönke Cordts, Maren Nasutta |
title_short | Algorithmen und Datenstrukturen in C# |
title_sort | algorithmen und datenstrukturen in c |
topic | C sharp (DE-588)4616843-6 gnd Algorithmus (DE-588)4001183-5 gnd Datenstruktur (DE-588)4011146-5 gnd |
topic_facet | C sharp Algorithmus Datenstruktur |
url | http://d-nb.info/1153562898/04 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=030272862&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT cordtssonke algorithmenunddatenstruktureninc AT nasuttamaren algorithmenunddatenstruktureninc AT manabuch algorithmenunddatenstruktureninc AT cordtssonke algorithmenunddatenstrukturenincsharp AT nasuttamaren algorithmenunddatenstrukturenincsharp AT manabuch algorithmenunddatenstrukturenincsharp |
Es ist kein Print-Exemplar vorhanden.
Inhaltsverzeichnis