Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °

You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**666 bro****Member**- From: Flatland
- Registered: 2019-04-26
- Posts: 706

How programming is different from algorithms?

"An equation for me has no meaning, unless it expresses a thought of God"- Srinivasa ramanujan

Offline

**Jai Ganesh****Administrator**- Registered: 2005-06-28
- Posts: 47,158

Hi,

(a) Computer programming is the process of designing and building an executable computer program to accomplish a specific computing result. Programming involves tasks such as: analysis, generating algorithms, profiling algorithms' accuracy and resource consumption, and the implementation of algorithms in a chosen programming language (commonly referred to as coding). The source code of a program is written in one or more languages that are intelligible to programmers, rather than machine code, which is directly executed by the central processing unit. The purpose of programming is to find a sequence of instructions that will automate the performance of a task (which can be as complex as an operating system) on a computer, often for solving a given problem. Proficient programming thus often requires expertise in several different subjects, including knowledge of the application domain, specialized algorithms, and formal logic.

Tasks accompanying and related to programming include: testing, debugging, source code maintenance, implementation of build systems, and management of derived artifacts, such as the machine code of computer programs. These might be considered part of the programming process, but often the term software development is used for this larger process with the term programming, implementation, or coding reserved for the actual writing of code. Software engineering combines engineering techniques with software development practices. Reverse engineering is the opposite process. A hacker is any skilled computer expert that uses their technical knowledge to overcome a problem, but it can also mean a security hacker in common language.

(b) In mathematics and computer science, an algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. Algorithms are always unambiguous and are used as specifications for performing calculations, data processing, automated reasoning, and other tasks.

As an effective method, an algorithm can be expressed within a finite amount of space and time, and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

The concept of algorithm has existed since antiquity. Arithmetic algorithms, such as a division algorithm, was used by ancient Babylonian mathematicians c. 2500 BC and Egyptian mathematicians c. 1550 BC. Greek mathematicians later used algorithms in the sieve of Eratosthenes for finding prime numbers, and the Euclidean algorithm for finding the greatest common divisor of two numbers. Arabic mathematicians such as al-Kindi in the 9th century used cryptographic algorithms for code-breaking, based on frequency analysis.

The word algorithm itself is derived from the 9th-century mathematician Muḥammad ibn Mūsā al-Khwārizmī, Latinized Algoritmi. A partial formalization of what would become the modern concept of algorithm began with attempts to solve the Entscheidungsproblem (decision problem) posed by David Hilbert in 1928. Later formalizations were framed as attempts to define "effective calculability" or "effective method". Those formalizations included the Gödel–Herbrand–Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's Formulation 1 of 1936, and Alan Turing's Turing machines of 1936–37 and 1939.

It appears to me that if one wants to make progress in mathematics, one should study the masters and not the pupils. - Niels Henrik Abel.

Nothing is better than reading and gaining more and more knowledge - Stephen William Hawking.

Offline

666 bro wrote:

How programming is different from algorithms?

Algorithms are an abstract idea that you have in your mind. Programs are concrete representations of them in a certain programming language.

Does that help?

'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'

'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'

I'm not crazy, my mother had me tested.

Offline

**666 bro****Member**- From: Flatland
- Registered: 2019-04-26
- Posts: 706

Yeah

"An equation for me has no meaning, unless it expresses a thought of God"- Srinivasa ramanujan

Offline

Also, here is a slightly different view:

A researcher of algorithms typically looks at problems taken out of context and tries to understand their mathematical/computational structure.

A software engineer typically has to build a certain software system for a specific real world task. While it is important that he has some idea of how algorithms work, much of his work is usually putting together tools to make information flow the right way.

In essence, algorithms research is rather theoretical in contrast to software engineering which requires more practical expertise.

'And fun? If maths is fun, then getting a tooth extraction is fun. A viral infection is fun. Rabies shots are fun.'

'God exists because Mathematics is consistent, and the devil exists because we cannot prove it'

I'm not crazy, my mother had me tested.

Offline

**renevanderlende****Member**- From: The Netherlands
- Registered: 2020-01-06
- Posts: 39

To understand an automation problem you need to ask many questions (the five Ws) before you can start coding anything. In my IT career I've come to 8:

**w8b4udo (wait before you do) who-what-where-when-which-whos-with-why => how**

By iterating over those questions, inevitably **how** to solve the problem will present itself. For IT problems this usually means **do some progamming**.

Algorithms are a way to solve specific problems programmatically.

Offline

**pi_cubed****Member**- From: A rhombicosidodecahedron
- Registered: 2020-06-22
- Posts: 115

666 bro wrote:

How programming is different from algorithms?

pi_cubed wrote:

Hi 666 bro,

In programming we say that we "implement algorithims" into programs, which gives us the idea that they are different. An algorithim is simply a thought process. Programming is implementing the algorithim, or writing it in a language that the interpeter can understand. Think of the programmer as an inventer. The idea for the invention is the algorithim. The invention is the code. Hope this clears things up.

*Sorry for some misspellings*

*Last edited by pi_cubed (2020-07-02 01:28:10)*

pi³

Offline

Pages: **1**