on 2- 3, 6
iteration 3- 4, 8
iteration 4- 5, 5 ( match)
But how can this help me with counting list elements? :(
Thanks,
D.
On Thu, Jan 8, 2009 at 5:48 PM, Diez B. Roggisch wrote:
>
> David Hláčik wrote:
>
> > Hi,
> >
> > so okay, i will create a helping set, where i will be
helping memory with constant size* ? This means i am not able to
create any set and adding elements there. I need to have a constant
size variables . This is complication a complication for me.
Thanks in advance!
David
On Wed, Jan 7, 2009 at 2:22 PM, Diez B. Roggisch wrote:
>
> David
dictionary with cycle structure
Hello guys,
I have a linked list where *number of elements is unlimited* and
**last element points on random (can be first, last, in middle ,
anywhere) element within linked list** - this is important . My goals
is to create an architecture /scheme for **algoritmus
Thank you guys for help and support! My homework is done and waiting
for grading.
Here it comes - bucket sort with time complexity O(n) == linear complexity
#! /usr/bin/python
def sort(numbers):
"sort n positive integers in O(n) provided that they are all from
interval [1, n^2]"
Hi guys,
#! /usr/bin/python
import random
import bucket2
data = [ random.randint(1,25) for i in range(5)]
print "random data : %s" % data
print "result: %s" %bucket2.sort(data)
How to write a test script which will outputs execution time for
bucket2.sort(data) ?
Thanks in advance!
--
http://ma
> Unless I grossly miss out on something in computer science 101, the lower
> bound for sorting is O(n * log_2 n). Which makes your task impossible,
> unless there is something to be assumed about the distribution of numbers in
> your sequence.
There is n numbers from interval [1 , n^2]
I should d
Hi guys,
i am really sorry for making offtopic, hope you will not kill me, but
this is for me life important problem which needs to be solved within
next 12 hours..
I have to create stable algorithm for sorting n numbers from interval
[1,n^2] with time complexity O(n) .
Can someone please give m
Hello ,
following scenario
list_current = [ "welcome", "search", "done", "result"]
list_ldap = [ "welcome", "hello"]
result:
list_toadd = [ "hello"]
by words said , i want to check if list item from list_ldap exists in
list_current if not i want to add it to list_toadd.
Thanks!
D.
--
http://m
rom nnrpd_auth.py :
*import commands
result = commands.getoutput('ls -l')
syslog('notice', result)
*And now please note the result from INN where result is completely ignored
:*
Jun 7 13:15:20 dev01 nnrpd[1400]: python: n_a authenticate() invoked:
hostname dav
py :
from authenticate :
try:
syslog('notice', "result %s" %
self.newsauth('boss',''))
except Exception, msg:
syslog('notice', "error %s, %s, %s" %
(type(msg),msg.args,m
Hello, what this beautifull mesage which is messing me whole day means :
*python: error , ('No module named py',), No module named
py*
as a result of class pdg.py which is called from nnrpd_auth.py.
To be detailed ... news server inn is calling that when doing
autentification , it calls nnrpd_au
Hello, what this beautifull mesage which is messing me whole day means :
*python: error , ('No module named py',), No module named
py*
as a result of class pdg.py which is called from nnrpd_auth.py.
To be detailed ... news server inn is calling that when doing
autentification , it calls nnrpd_au
12 matches
Mail list logo
