Home
Search
Recent Topics
Hottest Topics
Top Downloads
Register
Login
Preview
Subject:
Forum Index
»
Test Forum
Reply to "What is Asymtotic Analysis ?"
Subject
Message body
Emoticons
More smilies
Bash
CSS
C++
C#
Diff
Eiffel
Erlang
Fortran
Go
Groovy
Java
JavaScript
JSON
Haskell
Kotlin
Lisp
Lua
Julia
Pascal
Perl
PHP
Plain
Prolog
Python
R
Ruby
Rust
Scala
Smalltalk
SQL
Swift
VB.Net
XML, HTML etc.
Text Color:
Default
Dark Red
Red
Orange
Brown
Yellow
Green
Olive
Cyan
Blue
Dark Blue
Violet
White
Black
Font:
Very Small
Small
Normal
Big
Giant
Close Marks
[quote=Shashank] Asymptotic analysis of an algorithm refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case, and worst case scenario of an algorithm. Asymptotic analysis is input bound i.e., if there's no input to the algorithm, it is concluded to work in a constant time. Other than the "input" all other factors are considered constant. Asymptotic analysis refers to computing the running time of any operation in mathematical units of computation. For example, the running time of one operation is computed as f(n) and may be for another operation it is computed as g(n2). This means the first operation running time will increase linearly with the increase in n and the running time of the second operation will increase exponentially when n increases. Similarly, the running time of both operations will be nearly the same if n is significantly small. Usually, the time required by an algorithm falls under three types − Best Case − Minimum time required for program execution. Average Case − Average time required for program execution. Worst Case − Maximum time required for program execution. [/quote]
Options
Attachments
Disable HTML in this message
Disable BB Code in this message
Disable smilies in this message
Limit of files to attach:
3
Type in the text field the word shown in the image:
Hard to see the words?
Generate a new one
Review message