# algorithm for problem solving in computer

Design the algorithm to solve the problem. … Algorithms are the building blocks of everything a computer does. In mathematics and computer science, an algorithm (/ ˈ æ l ɡ ə r ɪ ð əm / ()) is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. Any piece of software is, at its basic level, a careful combination of many different algorithms. Given a problem, a computer scientist’s goal is to develop an algorithm, a step-by-step list of instructions for solving any instance of the problem that might arise. We will be adding more categories and posts to this page soon. An algorithm includes calculations, reasoning, and data processing. Please see Data Structures and Advanced Data Structures for Graph, Binary Tree, BST and Linked List based algorithms. Implementation. Algorithmic problem solving skills is one of the most important skills for a programmer. Software development method (SDM). Problem analysis. See recently added problems on Algorithms on PRACTICE. You can create a new Algorithm topic and discuss it with other geeks using our portal PRACTICE. This happens, in particular, for many problems involving a very large number of choices; you will see examples of such difficult problems in Chapters 3, 11, and 12. Algorithms are always unambiguous and are used as specifications for performing calculations, data processing, automated reasoning, and other tasks. This is, of course, a general and very vague answer. Computer science is the study of problems, problem-solving, and the solutions that come out of the problem-solving process. Using computer’s in problem solving. Consists of the following steps: Requirements specifications (Specification of needs). Great programmers are able to conceptually come up with solutions by visualizing and breaking down the problem into smaller parts. Second, available algorithms for solving a problem exactly can be unacceptably slow because of the problem’s intrinsic complexity. In order to solve a mathematical or computer problem, this is the first step in the process. Understanding the problem:The problem given should be understood completely.Check if it is similar to some standard problems & if a Known algorithm exists.otherwise a new algorithm has to be devised.Creating an algorithm is an art which may never be fully automated. To write a logical step-by-step method to solve the problem is called the algorithm; in other words, an algorithm is a procedure for solving problems. An algorithm, whose characteristics will be discussed later, is a form that embeds the complete logic of the solution. Its formal written version is called a program, or code. Thus, algorithmic problem solving actually comes in two phases: derivation of an algorithm that solves the problem, and conversion of the algorithm into code. Testing and verification.