Mailing List Archive
tlug.jp Mailing List tlug archive tlug Mailing List Archive
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]Re: [tlug] "How to"
- Date: Mon, 12 May 2014 23:29:51 +0200
- From: Bruno Raoult <braoult@example.com>
- Subject: Re: [tlug] "How to"
- References: <CAJA1Y2bTWLWhb0tcuZyeJQDXtAXsGRdyUw_T_Ft7sZ_W6nXhLQ@mail.gmail.com> <2490483.h4n0IKj4dS@dan> <CAJA1Y2Ztp4S==NeP7+8tBjH3XLUHnmESOOwJsQXgBhgzdJoHFA@mail.gmail.com> <2704911.eISib2PYI2@dan>
On Mon, May 12, 2014 at 11:06 PM, Daniel A. Ramaley <daniel.ramaley@example.com> wrote:
I am sorry that i misunderstood and replied
inappropriately.No problem Daniel. Please let us forget about it. Tomorrow will be shiny here.By the way, I am preparing 2 scripts doing the job. They are totally different.
But they both will be able to make it.One is based on a simple text file, the second one with a DB (sqlite). I did not find a betterway to do the job. I must admit that I only focus on the DB method, I really cannot get the
file method to be efficient... This is why we want to discuss... I am sure more brains will giveus different methods.As you did not like my question, I wonder if pure algo is something acceptable?
Like:Let say we have a 10,000 array of 0 and 1. You want to find the longest series of "1" (and itsposition). One pass only. We don't care language here, just algorithm.
But we go outside Linux scope. As I love both subjects, anyone will be fine for me :)br.
--
2 + 2 = 5, for very large values of 2.
- References:
- [tlug] "How to"
- From: Bruno Raoult
- Re: [tlug] "How to"
- From: Daniel A. Ramaley
- Re: [tlug] "How to"
- From: Bruno Raoult
- Re: [tlug] "How to"
- From: Daniel A. Ramaley
Home | Main Index | Thread Index
- Prev by Date: Re: [tlug] "How to"
- Next by Date: Re: [tlug] "How to"
- Previous by thread: Re: [tlug] "How to"
- Next by thread: Re: [tlug] "How to"
- Index(es):
Home Page Mailing List Linux and Japan TLUG Members Links