Algorithms and Time Complexity
This group is for discussions related to Algorithms and their Time Complexity
dashboard    feed    |FILTER :    videos    slides    links    quiz    |SEARCH :    youtube    slideshare    quizlet    Google    
Posts
Priority Queues

Priority QueuesIntroductionHeaps
06-Jan-2014
Priority Queues

The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne surveys the most important algorithms and data structures in use today. The broad perspective taken makes it an appropriate introduction to the field.
06-Jan-2014
np

P and NP : Informally,As always, when we say "polynomial time" without qualification, we mean polynomial in the number of bits in which the problem input is encoded.
23-Oct-2013
YouTube


23-Oct-2013
Big O notation - Wikipedia, the free encyclopedia

Big O notation : In mathematics, big O notation describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is called Landau notation, Bachmann?Landau notation (after Edmund Landau and Paul Bachmann), or asymptotic notation. In computer science, big O notation is used to classify algorithms by how they respond (e.g., in their processing time or working space requirements) to changes in input size. In analytic number theory, it is used to estimate the "error committed" while replacing the asymptotic size, or asymptotic mean size, of an arithmetical function, by the value, or mean value, it takes at a large finite argument. A famous example is the problem of estimating the remainder term in the prime number theorem.
29-Sep-2013
Binary Search Trees

The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne surveys the most important algorithms and data structures in use today. The broad perspective taken makes it an appropriate introduction to the field.
25-Sep-2013
Search Results from       Next>>
      Next>>