notes consider an unsorted array [nof integer elements that may have many elements present more than once it is required to store only the distinct elements of the array in separate array the information about the number of times each element is replicated is maintained in third array for examplec[ would indicate the number of times the element [ occurs in array write program to generate the arrays and cgiven an array write program that finds the largest and the second largest elements in an unsorted array the program should make just single scan of the array distinguish between internal and external method of sorting answersself assessment ( ( ( sorting (nlog ( log( ) ( (nlog ( ) false false true ( false further readings books brian kernighan and dennis ritchiethe programming languageprentice hall burkhard moniendata structures and efficient algorithmsthomas ottmannspringer krusedata structure program designprentice hall of indianew delhi mark allen welesdata structure algorithm analysis in csecond ed addisonwesley publishing rg dromeyhow to solve it by computercambridge university press shi-kuo changdata structures and algorithmsworld scientific shi-kuo changdata structures and algorithmsworld scientific sorenson and tremblayan introduction to data structure with algorithms thomas cormencharles eleiserson ronald rivestintroduction to algorithms prentice-hall of india pvt limitednew delhi timothy buddclassic data structures in ++addison wesley online links www en wikipedia org www web-source net www webopedia com lovely professional university