User:Valepert/Books/Algorithms and Data Structures
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Algorithms and Data Structures
- Introduction
- Algorithm
- Analysis of algorithms
- Computability theory
- Computational complexity theory
- Model of computation
- Random access machine
- Memory address register
- Memory data register
- Arithmetic logic unit
- Microcode
- Turing machine
- Optimization algorithms
- Karatsuba algorithm
- Schönhage–Strassen algorithm
- Merge sort
- Quicksort
- Comparison sort
- Decision tree model
- Stirling's approximation
- Matrix multiplication
- Strassen algorithm
- Coppersmith–Winograd algorithm
- Optimal substructure
- Dynamic programming
- CYK algorithm
- Greedy algorithm
- Knapsack problem
- Data structures
- Data structure
- Array data structure
- Linked list
- Hash table
- Hash function
- Stack
- Queue
- LIFo
- FIFO
- Binary tree
- Heap
- Binary search tree
- Self-balancing binary search tree
- AVL tree
- Red-black tree
- 2-3 tree
- Priority queue
- Amortized analysis
- Graph
- Graph in computer science
- Graph in mathematics
- Graph theory
- Vertex
- Adjacency matrix
- Adjacency list
- Depth-first search
- Breadth-first search
- Tree
- Biconnected graph
- Kruskal's algorithm
- Shortest path problem
- Semiring
- Boolean algebra
- Tropical geometry
- Bellman–Ford algorithm
- Dijkstra's algorithm
- NP-completeness
- Non-deterministic Turing machine
- Computation tree
- P versus NP problem
- P
- NP
- NP-complete
- Boolean satisfiability problem
- Boolean function
- Disjunctive normal form
- Conjunctive normal form
- Cook–Levin theorem
- Clique problem
- Clique
- Vertex cover
- Practical problem
- Spanning tree
- Big O notation
- Best, worst and average case
- Search algorithm
- Linear search
- Binary search algorithm
- Divide and conquer algorithm
- Recursion
- Master theorem
- Sorting algorithm
- Sorting algorithm
- Selection sort
- Insertion sort
- Bubble sort
- Heapsort
- Bucket sort
- Radix sort
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.