Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: OT: Mathematics for programming (again)

by dwm042 (Priest)
on Sep 11, 2008 at 14:24 UTC ( #710619=note: print w/ replies, xml ) Need Help??


in reply to OT: Mathematics for programming (again)

Given a sorted array and a value we know is in it, why can we know for sure that if we search it in linear order starting at the beginning, we will eventually always find the value at some index? It sounds very basic, and it's not difficult to prove, but the mythical algebra could be built on simple theorems like this, much like Eucledian geometry, and then expanded to cover deeper and more meaningful theorems.

Just a gut feeling, but I suspect most questions like these are going to map into set theory and number theory, in much the same way steady state kinetics equations map into the mathematics of graph theory.


Comment on Re: OT: Mathematics for programming (again)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://710619]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (8)
As of 2014-12-17 22:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (40 votes), past polls