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 |
define profiler???
Given: coordinates of rectangle-> left bottom and right top points. the rectangles create a hole.Find the maximum area of the hole. eg. 4 rectangles create a hole in between. find its area.
class A{ void me(){s.o.p("");} class B extends A{ void me() {s.o.p(" ");} class M{ A a=new B(); B b=new A(); a.me(); b.mne();} what is the output of this, how?
2 Answers Cosmos, HyTech Pro, WinSoft,
What for decision coverage and modified condition decision coverage are used? Wat is the difference between them?
you have an unlimited supply of $3 and $7 poker chips. What is the largest integer value that you cannot make by combining different numbers of chips?
This is the portal and portlet interview question API: is JSR 168 API Server: is ibm web sphere portal server6.0 IDE: is RAD 7.0 Question:In normal struts what is the actionservlet? Ans:org.apache.struts.action.ActionServlet. But What is the actionservlet in strutsportlet?
What sysoption determines where the macro facility searches a specific catalog for complied macro?
Find out the list of roles which gives access to GUI activities? thanks in advance
I want sample papers for NIC Examination. Plz send them to my mail Id das.neelam@gmail.com . Plz send it today, tomorrow i've the exam.
what is posix?
19. Given a system that is described with the following equation, X=A+(B.(A̅+C)+C)+A.B.(D̅+E̅) a) Simplify the equation using Boolean Algebra. b) Implement the original and then the simplified equation with a digital circuit. c) Implement the original and then the simplified equation in ladder logic.
Given an array of size n, containing every element from 1 to n+1, except one. Find the missing element.