Given 1 to n random number, find top 10 maximum numbers and
explain the time complexity of the algorithm.
Answer Posted / sreejesh1987
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
create a stucture student containing field for roll no,class,year and marks.create 10 student annd store them in a file
write a program using 2 D that searches a number and display the number of items 12 inputs values input 15,20, 13, 30, 38, 40,16, 18, 20 ,18 ,20 enter no. to search : 20
write a function that reverse the elements of an array in place.The function must accept only one pointer value and return void.
Code for Method of Handling Factorials of Any Size?
how to take time as input in the format (12:02:13) from user so that controls remains between these columns?
solve the problem in the programming language C++"if a five digit number is input through the keyboard.Write a program to calculate the sum of its digits(hint: use the modulus operator)
output for printf("printf");
develop a program to calculate and print body mass index for 200 employees
write a program that prompt the user to enter his height and weight,then calculate the body mass index and show the algorithm used
Given a table of the form: Product Sold on A 1/1/1980 B 1/1/1980 C 1/1/1980 A 1/1/1980 B 1/1/1980 C 2/1/1980 A 2/1/1980 There are 30 products and 10,000 records of such type. Also the month period during which sales happened is given to u. Write the program to display the result as: Product Month No. of copies A January 12 A February 15 A March 27 B January 54 B February 15 B March 10 C January 37
How to swap two ASCII numbers?
write a program that reads a series of strings and prints only those strings begging with letter "b"
Teta-Omeg-Big-Oh Show that f(n) = n2 + 3n3 is ;(n3).
Code for Two Classes for Doing Gzip in Memory?
write a program that creates a sequenced array of numbers starting with 1 and alternately add 1 and then 2 to create the text number in the series , as shown below. 1,33,4,6,7,9,............147,148,150 Then , using a binary search , searches the array 100 times using randomly generated targets in the range of 1 to 150