object-oriented algorithm

object-oriented algorithm

1. to develop software to solve a problem should terner the correct algorithm.

   • if a specific search algorithm and a key is selected. the size of the search esctuctura determine the number of records that the aogoritmo consideration.
     • Families Function
       • to know the efficiency of an algorithm accurately is pratically impossible, since there are various factors that are difficult to quantify, the efficiency of an algorithm allows trying to find an expression that depends on the parameter n that can be used to approximate the development of the same. it is determined that family belongs fuuciones this function allows you to ignore all the coefficients of a function as well as all terms execpto the dominant term of the function.
     • comparative conditions
       • conditions that are typically used for algorithms are commonly compared and evaluated as the best or worst ecenario. There is another case which is also the average case: this is rarely easy to quantify mind as the best case or worst case, it requires a bit more mathematical sophistication. the search key is equally likely to be found anywhere in the structured.
         • The efficiency of the algorithms refers to the time and space required for its implementation, given an input of size n. you need to have elements of analysis that allow us dectectar deficiencies to take corrective measures before taking the computer algorithms.
     • Runtime of an algorithm
       • The execution time of an algorithm is available in two basic properties of the notation-O (Smith (5)): additive property of the notation. if you have a Pi Pj followed by another algorithm such that it runs a long IT. Property multiplicative notation-O; if you have a P algorithm containing parts and subparts Pi Pj such that the LPT Pi steps are executed in a time Ti = O (f (m)) and internal steps Pij run in a while.
         • conclution