Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / nashiinformaticssolutions
o Big-O notation describes the performance or complexity of an algorithm in terms of the size of the input. Common examples:
O(1)O(1): Constant time
O(n)O(n): Linear time
O(logn)O(log n): Logarithmic time
O(n2)O(n^2): Quadratic time
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
what is programmable BIST in today ic design
Write a program to find duplicate number from array in minimum time complexity.
When will you use shell script/Perl ahead of C/C++?
what is woransient key word? how it is used in java
Difference between views and index in sas programming
in a VB application, where the data will be stored after manipulation? what is the syntax for that?
hi this is uday i want prepare for nic exam if any one have previous question papers please send me or atlest guide me how to prepare my ID is udaykiran4u@in.com
why we use abstract in awt?
You are given a dictionary of all valid words. You have the following 3 operations permitted on a word: delete a character, insert a character, replace a character. Now given two words - word1 and word2 - find the minimum number of steps required to convert word1 to word2. (one operation counts as 1 step.)
what is the use of occurs 10 or (any number) in the internal table declaration with header line.
Wrtite a JCL for sorting a file with start from 36 postion lenth 9 excluding a num eq to 98768. for 3 marks mainframe
how do you generate source code for the automatic generation for receipt number
Difference between HTML and DHTML?
what are the 3 forms of a prolog term
Is the IT field raise again? What is the position of IT after 4 years?
