Min-Max
Write an algorithm that finds both the smallest and
largest numbers in a list of n numbers and with complexity
T(n) is at most about (1.5)n comparisons.
- 10 Answers
- 43412 Views
- ABC, College School Exams Tests, ITC Infotech, Kyambogo University, Qatar University, I also Faced
- E-Mail Answers
Answer Posted / jeya
in tree the left most elemt is minimum element.the right
most element is max element.
| Is This Answer Correct ? | 4 Yes | 7 No |
Post New Answer View All Answers
Write a program that print in screen a tree with its height taken from user by entering number of 4 digits and find the odd numbers then calculate the sum of odd numbers so he get the height of tree?
Teta-Omeg-Big-Oh Show that f(n) = n2 + 3n3 is ;(n3).
develop a program to calculate and print body mass index for 200 employees
write a function that allocates memory for a single data type passed as a parameter.the function uses the new operator and return a pointer to the allocated memory.the function must catch and handle any exception during allocation
Code for Two Classes for Doing Gzip in Memory?
write a program that can LOCATE and INSERT elements in array using c++ programming languages.
how to write a program that opens a file and display in reverse order?
3. Program to find the Sum of give series. a. (1)+(1+2)+(1+2+3)+(1+2+3+4)+……………………………….. b. 1/1+1/9+1/25+1/49+……………...
Performance Algorithm A performs 10n2 basic operations and algorithm B performs 300 lg n basic operations. For what value of n does algorithm B start to show its better performance?
write a program to calculate the amount of investment after a period n years if the principal investors was p and interest is calculated using compound interest,formular=a=p(1+r)^n
write a program that prompt the user to enter his height and weight,then calculate the body mass index and show the algorithm used
Code for Method of Handling Factorials of Any Size?
write a program to perform generic sort in arrays?
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
Ask the user to input three positive integers M, N and q. Make the 2 dimensional array of integers with size MxN, where all the elements of I (I = 1,…,M) line will be members of geometrical progression with first element equal to the number of line (I) and denominator q.
