Skip to content

Opening book details…

Can I read Design and Analysis of Algorithms on EtoBox?

Design and Analysis of Algorithms by Karamagi, Robert is a nonfiction available to read on EtoBox.

What is Design and Analysis of Algorithms about?

Algorithm 6 Asymptotic Analysis 11 Recurrence 21 Substitution Method 21 Iteration Method 22 Recursion Tree Method 23 Master Method 28 Sorting Analysis 31 Bubble Sort 31 Selection Sort 34 Insertion Sort 36 Divide and Conquer 39 Max - Min Problem 41 Binary Search 43 Merge Sort 46 Tower of Hanoi 50 Sorting 56 Heap Sort 56 Quick Sort 68 Stable Sorting 77 Lower Bound Theory 79 Sorting in Linear Time 91 Linear Time Sorting 91 Counting Sort 92 Bucket Sort 109 Radix Sort 111 Hashing 112 Hash Tables 116 Methods of Hashing 119 Open Addressing Techniques 124 Hash Function 130 Binary Search Trees 132 Red Black Tree 140 Dynamic Programming 152 Fibonacci Sequence 157 Matrix Chain Multiplication 158 Longest Common Sequence (LCS) 178 0/1 Knapsack Problem 185 Dutch National Flag 189 Longest Palindrome Subsequence 193 Greedy Algorithm 200 Activity Selection Problem 201 Fractional Knapsack 203 Huffman Codes 206 Activity or Task Scheduling Problem 212 Travelling Sales Person Problem 214 Backtracking 220 Recursive Maze Algorithm 223 Hamiltonian Circuit Problems 224 Subset-Sum Problem 230 N-Queens Problem 232 Minimum Spanning Tree 237 Kruskal's Algorithm 242 Prim's Algorithm 247 Shortest Paths 255 Negat

Who reads Design and Analysis of Algorithms?

It is typically read by self-directed learners exploring a subject in depth.

Common subject areas: history, science, philosophy, social sciences.

Author
Karamagi, Robert
Published
2020
Language
EN
Category
nonfiction
Subjects
Computer Science, Algorithms And Data Structures, Stem

More by Karamagi, Robert

Browse all works by Karamagi, Robert

Similar books