Computational complexity, Data Structure & Algorithms

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the program). In computer of science, the concept of runtime complexity has been studied vigorously.  Sufficient research is being carried out to determine more efficient algorithms for present problems. We studied several asymptotic notations, to define the time complexity and space complexity of algorithms, say the big-O, Omega & Theta notations.  These asymptotic orders of time & space complexity define how best or worst an algorithm is for an adequately large input.

We studied regarding the process of calculation of runtime complexity of several algorithms. The exact analysis of insertion sort was discussed to define the best case, worst case & average case scenario.

Posted Date: 4/4/2013 6:22:15 AM | Location : United States







Related Discussions:- Computational complexity, Assignment Help, Ask Question on Computational complexity, Get Answer, Expert's Help, Computational complexity Discussions

Write discussion on Computational complexity
Your posts are moderated
Related Questions
Step 1: Declare array 'k' of size 'n' i.e. k(n) is an array which stores all the keys of a file containing 'n' records Step 2: i←0 Step 3: low←0, high←n-1 Step 4: while (l

the deference between insertion,selection and bubble sort

AVL trees and the nodes it contains must meet strict balance requirements to maintain O(log n) search time. These balance restrictions are kept maintained via various rotation func

how to write an algorithm for unions & intersection of two linklists?

HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENTS IN LINKED LIST?

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

Explain in brief about the Container An entity which holds finitely many other entities. Just as containers such as boxes, baskets, bags, pails, cans, drawers, and so for


If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

how to convert 12 hour format into 24 hour format using c program