Scribd
Upload
16 views118 pages

Algorithm Mid-Term Notes (Complete)

The document discusses various sorting algorithms including insertion sort, merge sort, selection sort, bubble sort, and counting sort, detailing their time complexities and operational procedures. It also covers greedy algorithms such as the fractional knapsack problem and Huffman coding for data compression, explaining the steps involved in constructing a Huffman tree and assigning codes based on character frequency. The content is technical and aimed at providing insights into algorithm efficiency and implementation.

Uploaded by

sabitmorsalinf
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
16 views118 pages

Algorithm Mid-Term Notes (Complete)

The document discusses various sorting algorithms including insertion sort, merge sort, selection sort, bubble sort, and counting sort, detailing their time complexities and operational procedures. It also covers greedy algorithms such as the fractional knapsack problem and Huffman coding for data compression, explaining the steps involved in constructing a Huffman tree and assigning codes based on character frequency. The content is technical and aimed at providing insights into algorithm efficiency and implementation.

Uploaded by

sabitmorsalinf
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd

You might also like