Academic Algorithms

Home

Recursion Stacks Strings

Linked Lists Queues Arrays

Sorting Searching Hashing

Trees Heaps Graphs

Dynamic programming Greedy divide and conquer

Backtracking Bit manipulation Matrix

Search here for all the info you want in this Blog

Interview Questions on Heaps

Labels: Heaps, Interview Questions

No comments:

Post a Comment

Newer Post Older Post Home

Subscribe to: Post Comments (Atom)

Data Structures & Algorithms

Analyzing Algorithms

Computational and Asymptotic Complexity
Notion of best case, average case and worst case
Big-Oh Notation, Omega and Theta Notations

Recursion

What is recursion ?

Backtracking

Arrays

Linked Lists

Stacks

Queues

Trees

Binary Trees Binary Search Tree

Heap

Hash table

Searching

Sequential Search
Binary Search
Hash Based Search

Sorting

Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort

Algorithm Design Techniques Greedy Method Divide and Conquer Dynamic Programming Graph Algorithms Complexity Classes

Labels

Interview Questions Array Search Binary Search Binary Tree Rotated Array Search Array Binary Search Tree Graph Graphs Hashing Heaps Linked List Matrix Queues Stack data structures and algorithms

Followers