http://bytes.com Algorithms and Advanced Maths - Get answers to questions about Maths Logic and Algorithm maths as it relates to programming. en Sat, 21 Nov 2009 02:01:11 GMT vBulletin 60 http://bytes.com/images/misc/rss.jpg http://bytes.com http://bytes.com/topic/algorithms/answers/877218-writing-algorithm-spell-word-oregon-pep7-language-machine Wed, 18 Nov 2009 06:09:00 GMT Write "o"
write "r"
write "e"
write "g"
write "o"
write "n"
.end ]]> answers shine1lytskin28 http://bytes.com/topic/algorithms/answers/877218-writing-algorithm-spell-word-oregon-pep7-language-machine http://bytes.com/topic/algorithms/answers/877138-what-computer-theory Tue, 17 Nov 2009 05:03:19 GMT Well, if you need some information to the issues just email for help. I can help you for just a general information about it. Well, if you need some information to the issues just email for help. I can help you for just a general information about it. ]]> answers renaik http://bytes.com/topic/algorithms/answers/877138-what-computer-theory http://bytes.com/topic/algorithms/answers/876525-extracting-data-line-field-written-text Wed, 04 Nov 2009 10:38:10 GMT I have an article in one cell of an Excel, from which I wanted the words in the second line. The article is Exclusive: Goldman hires Mike... I have an article in one cell of an Excel, from which I wanted the words in the second line.


The article is

Exclusive: Goldman hires Mike Workman from UBS ahead of sovereign Eurobond decision
Emergingmarkets, 02 Nov 2009

http://emergingmarkets.me/2009/11/goldman-hires-mike-workman-from-ubs-ahead-of-sovereign-eurobond-decision/

Goldman Sachs have hired Michael Workman from UBS for a senior role in fixed income just as the US investment bank expects to land a key role on Russia’s $17bn Sovereign Eurobond issue.

The Wall Street Bank declined to comment but a source close to Goldman Sachs in Moscow confirmed Workman had already joined their Moscow operation in “a senior role.”


I wanted to take out only the data in the second line i.e. "Emergingmarkets, 02 Nov 2009"


Can anyone help me in this??? ]]> answers Ainudeen http://bytes.com/topic/algorithms/answers/876525-extracting-data-line-field-written-text http://bytes.com/topic/algorithms/answers/876492-complexity-problem Tue, 03 Nov 2009 19:37:51 GMT I have an algorithm wich I'm trying my best to find it's complexity but I realy have a problem with recursions. I have two versions.
I've come down to this:
Version1: T(n) = 2n * Sum(1<i<n)[ T(i) + T(n-i) ]
Version2: T(n) = n * Sum(1<i<n)[ T(i) + T(n-i) ]

I wanna know the complexity in the form of O(something), can anyone enlight me on this? ]]> answers desaurido http://bytes.com/topic/algorithms/answers/876492-complexity-problem