Analysis and Design of Algorithms - Transform and Conquer
This unit defines the technique of transform and conquers. It describes the method of presorting, the Gaussian elimination technique and the approach of AVL and 2-3 trees in balanced search trees. It also defines heap sort and the problem reduction strategy.
Written for
- Institution
- Sikkim Manipal University
- Course
- Analysis and Design of Algorithms (MCA4040)
Document information
- Uploaded on
- June 13, 2022
- Number of pages
- 27
- Written in
- 2021/2022
- Type
- Class notes
- Professor(s)
- Joseph
- Contains
- All classes
Subjects
-
transform and conquer
-
tranform and conquer
-
transfrom and conquer
-
divide and conquer
-
decrease and conquer
-
divide and conquere
-
fast fourier transform
-
divide and conquer
-
transform and conquer techniques
Also available in package deal