Question
When analyzing the performance of a sorting algorithm,
what is a common operation to count for time complexity? ÂSolution
For comparison-based sorting algorithms, the number of comparisons and swaps (or assignments) are the fundamental operations that dominate the running time and are therefore typically counted to determine time complexity.
- Which of the following is not a perfect square?
Gaurav ate in a restaurant and got a membership discount of 30% on the original bill amount but he has to pay 9% as service tax and 8% service charge on...
Three numbers are in the ratio 2:5:7. If the difference between the sum of the smallest and the largest number and the sum of the smallest and the secon...
In a class, the present students are in the ratio of boys to girls as 4:1. If 10 girls are absent and they form 10% of the total class strength, and no ...
How many Zeros can be formed by multiplying 10 times; 20 times; 30 times; 40 times; ...............times; 2000?
In a two-digit positive number, the digit in the tens place is one less than the square of the digit in the units place. Additionally, the difference be...
  find the value of this?Â
A = (9/4) × B and C = (1/12) × A. If (A + B + C) = 300, then find the value of (12C – B).
Three numbers are in the ratio 5:9:12. The sum of the largest and smallest of these numbers is 8500. What is the difference between the largest and smal...
If the largest three – digit number is subtracted from the smallest five – digit number, then the remainder isÂ
