Scribd
Upload
30 views1 page

Untitled

The document discusses Big-O notation and algorithm analysis including quicksort, binary search, matrix addition, merge sort, and applying various sorting algorithms like merge sort to example data.

Uploaded by

gayathri yerukonda
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
30 views1 page

Untitled

The document discusses Big-O notation and algorithm analysis including quicksort, binary search, matrix addition, merge sort, and applying various sorting algorithms like merge sort to example data.

Uploaded by

gayathri yerukonda
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

1. Give the Big–O notation definition and briefly discuss with suitable example.

2. Explain the method of determining the complexity of procedure by the step count approach.
Illustrate with an example.
3. Write Divide – And – Conquer recursive Quick sort algorithm and analyze the algorithm for
average time complexity.
4. Discuss the time complexity of Binary search algorithm for best and worst case.
5. Give the algorithm for addition of two matrices and determine the time complexity of this
algorithm by frequency – count method.
6. Discuss the Pseudo code conventions for expressing algorithms.
7. Write Divide – And – Conquer recursive Merge sort algorithm and derive the time complexity of
this algorithm.
8. Write the general method of Divide – And – Conquer approach.
9. Write a recursive algorithm for binary search and also bring out its efficiency.
10. Apply Merge Sort to sort the list 𝑎[1,10] = (31,28,17,65,35,42. ,86,25,45,52). Draw the tree of
recursive calls of merge sort functions

You might also like