What is Big-O notation?
Answer / 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 |
List and explain any five built in functions for Lists data type in python
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 worst case of AVL tree?
what is fisrt female program
___ method used to move a recordset pointer in nth position in DAG.
Hi Friends , i am very new in VB 6.0 Any body can able to help me ? i need interview question and answer vb 6.0 . please send honeysukumar@yhaoo.com
plz send me NIC Scientific Officer /Engineer-SB(Programmer) previous question paper or syllabus
needs examples for black box testing and white box testing
can anyone please tell me the procedure for the NIC personal interview as i have been selected for the post of scientist/technical assistant B
Who is the Best SAS/Clinical Trainer in Hyderabad
Write a shell program. Enter basic pay of an employee and calculate DA, HRA, Deduction, Gross pay and Net pay as follows: DA = 75 % of BASIC HRA = 10 % of BASIC DEDUCTION = 15 % of BASIC GROSS PAY = BASIC+DA+HRA NET PAY = GROSS PAY-DEDUCTION.
This is a puzzle question .... The warden meets with 23 new prisoners when they arrive. He tells them, "You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another. "In the prison is a switch room, which contains two light switches labeled A and B, each of which can be in either the 'on' or the 'off' position. I am not telling you their present positions. The switches are not connected to anything. "After today, from time to time whenever I feel so inclined, I will select one prisoner at random and escort him to the switch room. This prisoner will select one of the two switches and reverse its position. He must move one, but only one of the switches. He can't move both but he can't move none either. Then he'll be led back to his cell. "No one else will enter the switch room until I lead the next prisoner there, and he'll be instructed to do the same thing. I'm going to choose prisoners at random. I may choose the same guy three times in a row, or I may jump around and come back. "But, given enough time, everyone will eventually visit the switch room as many times as everyone else. At any time anyone of you may declare to me, 'We have all visited the switch room.' and be 100% sure. "If it is true, then you will all be set free. If it is false, and somebody has not yet visited the switch room, you will be fed to the alligators." What is the strategy they come up with so that they can be free?