Book: Data Structures and Algorithms Made Easy In Java
The official companian source code for the book Data Structures and Algorithms Made Easy In Java by Narasimha Karumanchi
Copyright (c) Dec 21, 2014 CareerMonk Publications and others. E-Mail : [email protected] Last modification by : Narasimha Karumanchi Book Title : Data Structures And Algorithms Made Easy In Java ISBN : 9781466304161 [For India]/9781468101270 [Except India] Warranty : This software is provided "as is" without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose.
The following topics are covered:
- Introduction
- Recursion and Backtracking
- Linked Lists
- Stacks
- Queues
- Trees
- Priority Queue and Heaps
- Disjoint Sets ADT
- Graph Algorithms
- Sorting
- Searching
- Selection Algorithms [Medians]
- Symbol Tables
- Hashing
- String Algorithms
- Algorithms Design Techniques
- Greedy Algorithms
- Divide and Conquer Algorithms
- Dynamic Programming
- Complexity Classes
- Miscellaneous Concepts
-
chapter01introduction Chapter 1: Introduction Growth functions like O(n), O(n^2), O(logn), etc -
chapter02recursionandbacktracking Chapter 2: Recursion and Backtracking -
chapter03linkedlists-1 chapter03linkedlists-1
The details to be added soon -
chapter03linkedlists-2-DLL chapter03linkedlists-2-DLL
The details to be added soon -
chapter03linkedlists-3-circular chapter03linkedlists-3-circular
The details to be added soon -
chapter03linkedlists-4-skiplist chapter03linkedlists-4-skiplist
The details to be added soon -
chapter03linkedlists-5-sort chapter03linkedlists-5-sort
The details to be added soon -
chapter03linkedlists-6-reverse chapter03linkedlists-6-reverse
The details to be added soon -
chapter03linkedlists-6-remove chapter03linkedlists-6-remove
The details to be added soon -
chapter03linkedlists-7-random chapter03linkedlists-7-random
The details to be added soon -
chapter03linkedlists-8-problems1 chapter03linkedlists-8-problems1
The details to be added soon -
chapter03linkedlists-8-problems2 chapter03linkedlists-8-problems2
The details to be added soon -
chapter04stacks-1-impl chapter04stacks-1-impl
The details to be added soon -
chapter04stacks-2-stackset chapter04stacks-2-stackset
The details to be added soon -
chapter04stacks-3-problems chapter04stacks-3-problems
The details to be added soon -
chapter05queues-1-impl chapter05queues-1-impl
The details to be added soon -
chapter05queues-2-problems chapter05queues-2-problems
The details to be added soon -
chapter06trees chapter06trees
The details to be added soon -
chapter07priorityqueues chapter07priorityqueues
The details to be added soon -
chapter08disjointsets chapter08disjointsets
The details to be added soon -
chapter09graphs chapter09graphs
The details to be added soon -
chapter10sorting chapter10sorting
The details to be added soon -
chapter11searching chapter11searching
The details to be added soon -
chapter11searching-problems chapter11searching-problems
The details to be added soon -
chapter12selectionalgorithms chapter12selectionalgorithms
The details to be added soon -
chapter15stringalgorithms chapter15stringalgorithms
The details to be added soon -
chapter17greedyalgorithms chapter17greedyalgorithms
The details to be added soon -
chapter18divideandconquer chapter18divideandconquer
The details to be added soon -
chapter19dynamicprogramming chapter19dynamicprogramming
The details to be added soon -
chapter21miscconcepts chapter21miscconcepts
The details to be added soon