I am Studying in IGNOU in MCA 3rd sem I need to do my assailment if you have some assailments then please give me so I can easily do the assignments. If possible provide solved assignments.

[Vishal Kotkar]

For your help here I am providing MCA 3rd sem assignments for IGNOU.

Question1: Using Insertion Sort, sort the following sequence in increasing order and do the analysis of the algorithm: 35, 37, 18, 15, 40, 12

Question 2: Write a pseudocode for divide and conquer algorithm for finding the position of an array of n numbers and estimate the
number of key comparisons made by your algorithm.

Question 3: Apply quicksort to sort the following list: Q U I C K S O R T in alphabetical order. Find the element whose position is
unchanged in the sorted list.

For the complete assignment click on the following attachment

Assignment solved 2019