Scribd
Upload
16 views1 page

Algo

Uploaded by

Rashadur Rahaman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views1 page

Algo

Uploaded by

Rashadur Rahaman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

What do you mean by Divide and Conquer (Strategy and Recurrences) Big Theta notation provides a tight bound,

es a tight bound, indicating both the Big Omega notation represents the lower bound or best-case
In the context of algorithms and problem-solving, "Divide and Conquer" is a upper and lower limits, essentially expressing the average-case scenario of an algorithm's runtime or space complexity.
strategy that involves breaking down a complex problem into performance of an algorithm
smaller, more manageable sub-problems. This approach consists of three
key steps:
Divide: The problem is divided into smaller sub-problems that are easier to
solve. This step continues recursively until the sub-problems become
simple enough to solve directly.
Conquer: Each sub-problem is solved independently. If a sub-problem is still
too complex, it is further divided into even smaller sub-problems
until a straightforward solution is possible.
Combine: The solutions to the sub-problems are combined to obtain the
solution for the original problem.

Binary Tree
A non linear tree data structure with the possibility of having at most two
children for each node.
May or may not be a binary search tree.
Not require to organize the nodes.
Unordered tree data structure.
Slow in carry out the tree operations.
Binary Search Tree
A variant of binary tree with extra node-based properties.
Always a binary tree.
Require to organize the nodes based on the key value.
Ordered tree data structure.
Efficient and fast in carry out the tree operations.
Complete Binary Tree
When the tree is complete then the last level might or might not be full.
A complete binary tree may or may not be an almost complete binary tree.
Heap data structure.

Definition
Tree: A hierarchical structure where nodes are connected by edges, often
used to represent relationships or organize data in a non-linear
manner.
Binary Tree: A type of tree structure where each node has at most two Big O notation describes the upper bound or worst-case
children, typically referred to as the left child and the right child. This scenario of an algorithm's runtime or space complexity.
structure is commonly used in various algorithms and data structures.
Binary Search Tree (BST): A binary tree with the additional property that for
each node, the values in its left subtree are less than or equal to
the node's value, and the values in its right subtree are greater than or equal
to the node's value. This property allows for efficient searching,
insertion, and deletion operations.
Complete Binary Tree: A binary tree in which all levels are filled except
possibly the last level, and all nodes in the last level are filled from left to
right. This structure is useful for efficient storage using an array and
simplifies certain algorithms

Merge Sort vs Quicksort are sorting algorithms:


Approach:
Merge Sort: Divides and merges the array, always guaranteeing stable
sorting.
Quicksort: Divides using a pivot, not always stable due to rearrangements.
Time Complexity:
Merge Sort: O(n log n) in all cases.
Quicksort: O(n log n) on average, but O(n^2) in the worst case.
Space Complexity:
Merge Sort: Requires extra space, O(n).
Quicksort: Often in-place, O(log n) auxiliary space.
Stability:
Merge Sort: Stable, maintains order of equal elements.
Quicksort: Not always stable.
Use Cases:
Merge Sort: Stable sorting, linked lists.
Quicksort: Memory efficiency, average-case performance, widely used

You might also like