User:Avitya/Books/CS
Edit this book: Book Creator · Wikitext
 | 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 ] | ||||||||
| WildBot has found potential problems with this book. Please check the talk page for a detailed explanation of what these might be and how to fix them. When these are resolved, you can remove |wildbot=yes from this template. |
Computer science topics
- General
- Analysis of algorithms
- Big O notation
- Best, worst and average case
- Sorting
- Sorting algorithm
- Insertion sort
- Shell sort
- Merge sort
- Heapsort
- Quicksort
- Introsort
- Bucket sort
- Counting sort
- Sorting network
- Pancake sorting
- Radix sort
- Comb sort
- Searching
- Linear search
- Binary search algorithm
- Selection algorithm
- Data Structures
- Array data structure
- Associative array
- Set (computer science)
- Multiset
- Hash table
- Bloom filter
- Double-ended queue
- Linked list
- Queue (data structure)
- Priority queue
- Stack (data structure)
- Circular buffer
- Heap (data structure)
- Binary heap
- Binomial heap
- Fibonacci heap
- Binary search tree
- Red-black tree
- AVL tree
- B-tree
- B+ tree
- 2-3 tree
- R-tree
- Trie
- Radix tree
- Graph Algorithms
- Graph (mathematics)
- Graph (data structure)
- Topological sorting
- Floyd–Warshall algorithm
- Dijkstra's algorithm
- Bellman-Ford algorithm
- Breadth-first search
- Depth-first search
- A* search algorithm
- Minimum spanning tree
- Prim's algorithm
- Borůvka's algorithm
- Kruskal's algorithm
- Flow network
- Maximum flow problem
- Ford–Fulkerson algorithm
- Edmonds–Karp algorithm
- Push-relabel maximum flow algorithm
- String Searching
- String searching algorithm
- Rabin-Karp string search algorithm
- Knuth–Morris–Pratt algorithm
- Boyer–Moore string search algorithm
- Finite-state machine
- Fisher–Yates shuffle
- Dynamic programming
- Longest common subsequence problem
- Longest increasing subsequence
- Shortest common supersequence
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.