@programminginc - страница 1106

Anonymous

Try Sockets>Http as http is a socket-prot

Dima

well to think right you need to think more about http and data sending (http) and not about sockets

Dima

I am writing my own http server and there are lot more logic for http and not for sockets, again

Sid Sun

I see, thank you; much appreciated! if there are any recommended resources, it'd be great; so far i've done C and my projects in it through improvisation and searching

Anonymous

Yes

Anonymous

And want Learn C/Cpp in detail

Anonymous

Hello guys.. I want to know what kind of indexer you are using for vim..

Anonymous

I used gtags, but it feel likes strange

Anonymous

rtags

Anonymous

Is there any higher level indexer?

Anonymous

Like ccls

Anonymous

Dunno, never used ccls. Which features do you need? Rtags is pretty powerful

Anonymous

Hmmm

Anonymous

I don't really know actully

Anonymous

What I relly need is auto refresh, I think

Sumeet

Just clicked to prove I am a human.

Mean Cat

We are trying to determine the worst case time complexity of a library function that is provided to us, whose code we cannot read. We test the function by feeding large numbers of random inputs of different sizes. We find that for inputs of size 40 and 400, the function always returns within one second, but for inputs of size 4,000 it sometimes takes about a minute and for inputs of size 40,000 it sometimes takes more than 10 minutes. What is a reasonable conclusion we can draw about the worst case time complexity of the library function?

klimi

We are trying to determine the worst case time complexity of a library function that is provided to us, whose code we cannot read. We test the function by feeding large numbers of random inputs of different sizes. We find that for inputs of size 40 and 400, the function always returns within one second, but for inputs of size 4,000 it sometimes takes about a minute and for inputs of size 40,000 it sometimes takes more than 10 minutes. What is a reasonable conclusion we can draw about the worst case time complexity of the library function?

Who

Mean Cat

We are trying to determine the worst case time complexity of a library function that is provided to us, whose code we cannot read. We test the function by feeding large numbers of random inputs of different sizes. We find that for inputs of size 40 and 400, the function always returns within one second, but for inputs of size 4,000 it sometimes takes about a minute and for inputs of size 40,000 it sometimes takes more than 10 minutes. What is a reasonable conclusion we can draw about the worst case time complexity of the library function?

Can anybody explain it??

klimi

Can anybody explain it??

i think yes

Mean Cat

Then plzz

klimi

well

klimi

400 -> 1 sec 4000 -> 10 sec 40000 -> 10min?

klimi

oh more than...

klimi

n^2?

Anonymous

Hello everyone

Anonymous

Can anyone help come up with a c++ project that relates to biomedical engineering

klimi

this is linelar

klimi

1 10 600 is not linear

klimi

400 -> 1 sec 4000 -> 10 sec 40000 -> 10min?

^

BinaryByter

imho, we should stop using hours

BinaryByter

and use kiloseconds

BinaryByter

3,6ks are one hour

BinaryByter

roughly

klimi

is kilo 1000 or 1024

BinaryByter

1000

BinaryByter

nobody uses 1024 for kilo

klimi

fuck latex...

klimi

i do

BinaryByter

latex is cool

klimi

it is not

klimi

its not doing what i want

BinaryByter

because you are not giving it what it wants

BinaryByter

maybe I can help you

BinaryByter

ask

Stefan

fuck latex...

agreed

Stefan

its too verbosive

BinaryByter

thats the point of latex

Stefan

being written by d. knuth doesn't mean its great

klimi

ask

okay

Stefan

i support mathml instead

BinaryByter

second order polynomial^

klimi

then its n^2 and i was right

BinaryByter

then its n^2 and i was right

you are perfect klimi

klimi

n^2?

^

klimi

btw i admire your gnuplot skills

klimi

you are perfect klimi

i wouldnt say that tho

klimi

but ty

BinaryByter

xDD

BinaryByter

yea I was just joking

BinaryByter

nobody is

klimi

that hurts now...

klimi

BinaryByter

xD

BinaryByter

lol you are still great!

klimi

oh that is weird indeed

klimi

your skill is superb

Stefan

lvl 100 boss

Wen

Hi

Stefan

yes in cs

Stefan

not in real life

Gabriel

Dima

wtf do I look like a CS student or what

Dima

(jk)

Stefan

infinitely many solutions?

Stefan

a - b = 9 c - d = 14 a + c = 12 b + d = 2 dependent vector

Stefan

wait

Stefan

not human

Stefan

so i use a wrong method to show that im human

Stefan