Anatomy of Insolvent to Solvent Technology

Abstract

“Anatomy of Insolvent to Solvent Technology“, implies finding problem solution from proper analysis. Paper presents initial steps to solve human being problems through computer. It includes the detailed information about problem, solution in terms of algorithm and analysis of algorithms in computer science field. Problem may be a state of mind of a living being, of not being satisfied with some situation. For problem the possible solution is a sequence of activities, that if carried out using available tools, leads us from the unsatisfactory position to an acceptable, satisfactory or desired position. One of the most important tool is to solve problem is an algorithm; algorithm can be implemented to the system as a program through any programming language. Analysis of algorithm is to determining the requirement of resources to execute it. The most important resources in computer system to execute the program are time and space. Analysis done in terms of complexity, complexity refers to the rate at which the required storage or consumed time grows with respect to the problem size. The absolute growth depends on the machine/compiler used to execute program. All algorithms falls in two classes known as deterministic polynomial (P) and non deterministic polynomial (NP) classes. The complexity class P is the set of decision problems that can be solved by a deterministic machine in polynomial time, i.e. O(nk) where k=1,2,3…. This class corresponds to set of problems which can be effectively solved in worst cases. The complexity class NP is a set of decision problems that can be solved by a nondeterministic machine in polynomial time. The time complexity of all NP class algorithms falls under exponential time such as O(2n), O(n!), etc., In this paper we will focus on P class algorithms to illustrate concept of algorithm and analysis..