Aug4

9:59 PM <HACKINTOSHRAO> hello guys
9:59 PM → chandankumar joined ([email protected])
10:00 PM <hackdroid> hello
10:01 PM <abhiramr> Ola!
10:01 PM <HACKINTOSHRAO> had dinner , all of u ??
10:01 PM <abhiramr> HACKINTOSHRAO: Naah, skipped.
10:01 PM <hackdroid> @hackintoshrao  nope
10:02 PM <fierch> yeah, had
10:02 PM <HACKINTOSHRAO> gimme 2 min
10:03 PM <abhiramr> sure
10:03 PM <hackdroid> @hackintoshrao  ahaaa
10:03 PM <abhiramr> fierch: Who are you?
10:03 PM <hackdroid> @abhiramr  its j1
10:04 PM <abhiramr> fierch: You can PM me if you'd like to be anonymous here. I'm maintaining a list of nicks to avoid profainty.
10:04 PM <abhiramr> profanity*
10:04 PM <fierch> No, I am getting banned on freenode
10:05 PM <fierch> so, connected through scrollback
10:05 PM <abhiramr> okay cool
10:05 PM <fierch> and if I sign in you get 2 messages from me
10:05 PM → ciefte2 joined (guest-cief@conference/jsconf/x-qfxzdfpjlgqhxaxw)
10:05 PM <ciefte2> @abhiramr
10:05 PM <fierch> Jeevan here
10:05 PM <abhiramr> Okay, cool.
10:05 PM <abhiramr> ciefte2: Yeah?
10:06 PM <HACKINTOSHRAO> guys
10:06 PM <HACKINTOSHRAO> how was the video ??
10:06 PM <fierch> didn't watch.
10:06 PM <HACKINTOSHRAO> anyone here missed out on watching the cideo ?
10:06 PM <fierch> yeah
10:06 PM <HACKINTOSHRAO> video*\
10:06 PM <hackdroid> @hackintoshrao  i am watching 4 th one
10:07 PM <abhiramr> HACKINTOSHRAO: Yes, I wasn't able to. Can anyone give a quick summary?
10:08 PM <hackdroid> @abhiramr richards only right?
10:08 PM <HACKINTOSHRAO> it would have been great on watching the video , anyways its fine
10:08 PM <HACKINTOSHRAO> yes 4 th video from the playlist
10:08 PM <abhiramr> yeah
10:08 PM <abhiramr> hackdroid: ^^ I was on the move. Will catch up after today's session.
10:09 PM ← ciefte2 left (guest-cief@conference/jsconf/x-qfxzdfpjlgqhxaxw)
10:09 PM <HACKINTOSHRAO> who else here are listening to the convo ??
10:10 PM <HACKINTOSHRAO> please give your attendance
10:10 PM <Vaishnavi> Me
10:10 PM <fierch> jeevan
10:10 PM <Vaishnavi> :P
10:10 PM <abhiramr> Abhiram
10:11 PM <Abhishek_Jain> me
10:11 PM <hackdroid> @hackintoshrao me
10:11 PM <Abhishek_Jain> and i am also watching the 4th video now
10:12 PM <HACKINTOSHRAO> 5 people here   , their names are ME , jeevan , :P , abhiram , me , @hackintoshrao me and the last name is weird  " and i am also watching the 4th video now"
10:12 PM <fierch> Haha
10:13 PM <Abhishek_Jain> Abhishek Jain
10:13 PM ⇐ sant0sh quit ([email protected]) Ping timeout: 264 seconds
10:13 PM <Abhishek_Jain> :(
10:13 PM → shreesha joined ([email protected])
10:13 PM <hackdroid> farhaan
10:13 PM <HACKINTOSHRAO>  " and i am also watching the 4th video now" , welcome to the session
10:13 PM → tushara joined (tushara@conference/jsconf/x-fldixdygcmxmpezw)
10:13 PM <HACKINTOSHRAO> ok lets start
10:13 PM <Abhishek_Jain> @hackintoshrao dude my name is abhishek :P
10:14 PM <fierch> @abhishek-jain you're romeo
10:15 PM <abhiramr> ramrutha: shreesha tushara Vaishnavi you guys listening?
10:15 PM <HACKINTOSHRAO> so we ended the discussion yesterday after we spoke about time complexities
10:15 PM <HACKINTOSHRAO> and how to compare and categorize algos
10:15 PM <HACKINTOSHRAO> right ??
10:15 PM <Vaishnavi> Yeah
10:15 PM <shreesha> yes!
10:15 PM <abhiramr> yes
10:16 PM <HACKINTOSHRAO> atleast by tomorrow trying watching the 4th video completly
10:16 PM <HACKINTOSHRAO> the discussion will be easier
10:16 PM <HACKINTOSHRAO> and interesting
10:17 PM <tushara> yes
10:17 PM <HACKINTOSHRAO> so anyone have an answer for yesterdays question ?? those who want to go for the ansswer please say +1
10:18 PM <HACKINTOSHRAO> anyone ??
10:18 PM <abhiramr> +1
10:19 PM <HACKINTOSHRAO> anyone else gave a try ??
10:19 PM <abhiramr> For those of you searching, this is the question: if you increase the no of inputs of bubble sort by 'X' times , by how many times does the running time of the program increases??
10:19 PM <abhiramr> 'X' takes values from 2 to 10
10:20 PM <HACKINTOSHRAO> abhi
10:21 PM <HACKINTOSHRAO> doesnt look like anyone else gave it a try
10:21 PM <tushara> increases from 4 to 100 (2^2 to 10^2)
10:21 PM <HACKINTOSHRAO> u go ahead
10:21 PM <HACKINTOSHRAO> ok
10:21 PM <HACKINTOSHRAO> whats your answer
10:21 PM <HACKINTOSHRAO> abhi
10:21 PM <HACKINTOSHRAO> @tushara gave an asnwer
10:21 PM  → sant0sh joined  ← shreesha left
10:22 PM <abhiramr> I have an answer. But I don't know if it's correct.
10:22 PM <HACKINTOSHRAO> @santosh : probably you are the best python programmer here , whenever you have help people out here ans please share your views
10:22 PM → shreesha joined ([email protected])
10:22 PM <HACKINTOSHRAO> @abhi
10:22 PM <HACKINTOSHRAO> please share
10:22 PM ← shreesha left ([email protected])
10:22 PM <hackdroid> @hackintoshrao I WANT TO LEARN PYTHON
10:23 PM <HACKINTOSHRAO> @hackdroid
10:23 PM <HACKINTOSHRAO> wait
10:23 PM <hackdroid> @hackintoshrao done with the blog?
10:23 PM <fierch> sant0sh
10:23 PM <HACKINTOSHRAO> yes , adding more information
10:23 PM <abhiramr> complexity of bubble sort is n squared. so if input size becomes x times, its (xn) sqaured
10:23 PM <HACKINTOSHRAO> @abhi , please sahre your answer
10:23 PM <abhiramr> *squared
10:24 PM <HACKINTOSHRAO> abhi when you say it is n squared , N is like a variable which takes values from 2 to 10
10:24 PM <abhiramr> yes
10:25 PM <HACKINTOSHRAO> so the answer is 2 , 9 , 16 , 25 , 36 , 49 , 64 , 81 , 100
10:25 PM <HACKINTOSHRAO> as tushara pointed out
10:25 PM <HACKINTOSHRAO> can spomeone explain the answer
10:25 PM — fierch claps
10:25 PM <HACKINTOSHRAO> elaborate
10:25 PM <maheshkumar> Okay
10:26 PM <tushara> ok....its because of the 2 "for loops" i.e, one for the steps another for the rearrangements in each iteration!!
10:27 PM <tushara> (i used C....i wanna learn python!!! ;) :p)
10:28 PM <HACKINTOSHRAO> so any algorithm if it is categorized as 'theta of N square ' that means if the no of inputs increases by two times the running time increases by 4 times
10:28 PM <HACKINTOSHRAO> if the no of input increases by 3 times the runnign time increases by 9
10:28 PM <HACKINTOSHRAO>  if the no of input increases by 4 times the runnign time increases by 16
10:29 PM → abraar joined ([email protected])
10:29 PM <HACKINTOSHRAO>  if the no of input increases by 5 times the running time increases by 25times
10:29 PM <HACKINTOSHRAO>  if the no of input increases by 6 times the running time increases by 36 times
10:29 PM <HACKINTOSHRAO> some one continue the sequence
10:29 PM <abhiramr> it's okay. we got the drift :P
10:29 PM <fierch> :P
10:29 PM → shreesha joined ([email protected])
10:30 PM <abhiramr> if you still want it,
10:30 PM <HACKINTOSHRAO> yes
10:30 PM <HACKINTOSHRAO> i want it
10:30 PM <HACKINTOSHRAO> !
10:30 PM <fierch> if the no of input increases by 7 times the running time increases by 49 times
10:30 PM <abhiramr>   if the no of input increases by 8 times the running time increases by 64 times
10:30 PM ← shreesha left ([email protected])
10:30 PM <fierch> if the no of input increases by 9 times the running time increases by 81 times
10:30 PM <abhiramr>  if the no of input increases by 9 times the running time increases by 181 times
10:30 PM <fierch> if the no of input increases by 10 times the running time increases by 100 times
10:30 PM <abhiramr> fierch: 81?
10:31 PM <tushara> f the no of input increases by 10 times the running time increases by 100 times
10:31 PM <HACKINTOSHRAO> yes
10:31 PM <fierch> abhiramr 181?
10:31 PM <HACKINTOSHRAO> good ppl :D
10:31 PM <HACKINTOSHRAO> 81 times :P
10:31 PM <abhiramr> damn. sorry, my bad :
10:31 PM <tushara> ;)
10:32 PM <abhiramr>  if the no of input increases by 9 times the running time increases by 81 times
10:32 PM — hackdroid afk
10:32 PM <HACKINTOSHRAO> ok now lets say there is an algorithm which is categorized as 'theta of N (not N squared)' , now form a sequence for it now
10:33 PM <tushara> if the no of input increases by 2 times the running time increases by 2 times
10:33 PM <HACKINTOSHRAO> continue ppl
10:33 PM <HACKINTOSHRAO> race
10:33 PM <HACKINTOSHRAO> race
10:33 PM <fierch> if the no of input increases by 2 times the running time increases by 2 times
10:33 PM <HACKINTOSHRAO> common faaaaaaaaast
10:33 PM <tushara> if the no of input increases by 3 times the running time increases by 3 times
10:33 PM <abhiramr>  if the no of input increases by 3 times the running time increases by 3 times
10:33 PM <HACKINTOSHRAO> go go go
10:33 PM <tushara> if the no of input increases by 4 times the running time increases by 4 times
10:34 PM <abhiramr>  if the no of input increases by 4 times the running time increases by 4 times
10:34 PM <abhiramr>  if the no of input increases by 5 times the running time increases by 5 times
10:34 PM <tushara> if the no of input increases by 5 times the running time increases by 5 times
10:34 PM <abhiramr>  if the no of input increases by 6 times the running time increases by 6 times
10:34 PM <abhiramr>  if the no of input increases by 7 times the running time increases by 7 times
10:34 PM <tushara> if the no of input increases by 7 times the running time increases by 7 time
10:34 PM → ark101 joined (ark10@conference/jsconf/x-jcyfzlufazerqmli)
10:34 PM <ark101> if the no of input increases by 6 times the running time increases by 6 times
10:34 PM <abhiramr>  if the no of input increases by 8 times the running time increases by 8 times
10:34 PM <tushara> if the no of input increases by 9 times the running time increases by 9 time
10:34 PM <abhiramr>  if the no of input increases by 9 times the running time increases by 9 times
10:34 PM <fierch> ok. stop spamming you buggers
10:34 PM <tushara> if the no of input increases by 10 times the running time increases by 10 time
10:34 PM <abhiramr>  if the no of input increases by 10 times the running time increases by 10 times
10:34 PM <ark101> if the no of input increases by 11 times the running time increases by 11 times
10:34 PM <abhiramr> yo, enough!
10:35 PM <HACKINTOSHRAO> cool !! ty ppl ....this is not lame !! this works !
10:35 PM <fierch> for(i=1;i<infiniti;i++)
10:35 PM <fierch> {
10:35 PM <HACKINTOSHRAO> there is a story behind this .
10:35 PM <fierch> if the no of inputs increases by i times the running time increases by i times
10:35 PM <fierch> }
10:35 PM <tushara> okay
10:35 PM <fierch> ok.. hackintosh came inside the loop -_-
10:35 PM <tushara> story??
10:36 PM <tushara> haha karthic inside look :D
10:36 PM <HACKINTOSHRAO> ok now lets say there is an algorithm which is categorized as 'theta of N Cube (not N squared or N)' , now form a sequence for it now
10:36 PM <tushara> *loop
10:36 PM <HACKINTOSHRAO> fast
10:36 PM <abhiramr>  if the no of input increases by 2 times the running time increases by 8 times
10:36 PM <abhiramr>  if the no of input increases by 3 times the running time increases by 27 times
10:36 PM <HACKINTOSHRAO> sexy
10:36 PM <abhiramr>  if the no of input increases by 4 times the running time increases by 64 times
10:36 PM <HACKINTOSHRAO> go
10:36 PM <abhiramr>  if the no of input increases by 5 times the running time increases by 125 times
10:36 PM <fierch> abhiramr enough
10:36 PM <HACKINTOSHRAO> abhi is the sole winner :D
10:36 PM <HACKINTOSHRAO> @fierch
10:36 PM <fierch> @abhiramr yeah. all hail abhi
10:36 PM <fierch> :P
10:36 PM <abhiramr>  if the no of input increases by 6 times the running time increases by 216 times
10:36 PM <HACKINTOSHRAO> pelase dont stop
10:37 PM <HACKINTOSHRAO> there is a reason
10:37 PM <abhiramr>  if the no of input increases by 7 times the running time increases by 314 times
10:37 PM → the_codebot|away joined ([email protected])
10:37 PM <HACKINTOSHRAO> its not bad to learn like this
10:37 PM <fierch> really? Okay. Bring it on
10:37 PM <HACKINTOSHRAO> @abhi
10:37 PM <HACKINTOSHRAO> go on
10:37 PM <tushara> if the no of input increases by 8 times the running time increases by 512 time
10:37 PM the_codebot|away → the_codebot
10:37 PM <abhiramr>  if the no of input increases by 8 times the running time increases by 512 times
10:37 PM <tushara> if the no of input increases by 9 times the running time increases by 729 times
10:37 PM — fierch calculating the cube of 9
10:37 PM <abhiramr>  if the no of input increases by 9 times the running time increases by 729 times
10:38 PM <abhiramr>  if the no of input increases by 10 times the running time increases by 1000 times
10:38 PM <abhiramr> done!
10:38 PM <abhiramr> :D
10:38 PM <tushara> @fierch if the no of input increases by 10 times the running time increases by 1000 times
10:38 PM <tushara> @fierch : Sry fr the tag....i dunno how it came there....
10:39 PM <abhiramr> tushara: Scrollback's effects :P
10:39 PM <fierch> no problem. Scrollback tags automatically
10:40 PM <tushara> ya ;)
10:40 PM → karthic_ joined ([email protected])
10:40 PM <karthic_> people open up your calculators now
10:41 PM <fierch> yeah, done.
10:41 PM <karthic_> let me know when you guys open up your calculators
10:41 PM <karthic_> put it into scientific mode
10:41 PM <abhiramr> done
10:41 PM ⇐ HACKINTOSHRAO quit ([email protected]) Ping timeout: 255 seconds
10:41 PM <abhiramr> that might be difficult
10:42 PM <karthic_> ok, now lets say there is an algorithm which is categorized as 'theta of logN to base 10 (not N squared,cube or N)' , now form a sequence for it now
10:42 PM <karthic_> lets c how many can do this
10:43 PM <fierch> if the no of input increases by 2 times the running time increases by  0.301029995  times
10:43 PM <karthic_> ok
10:43 PM <karthic_> go
10:43 PM <abhiramr>  if the no of input increases by 2 times the running time increases by 0.301 times
10:44 PM <fierch> if the no of input increases by 3 times the running time increases by  0.47712125472   times
10:44 PM <fierch> abhiram you're slow
10:44 PM <tushara> if the no of input increases by 3 times the running time increases by 0.4771 time
10:44 PM <fierch> buck uo
10:44 PM <abhiramr>  if the no of input increases by 3 times the running time increases by 0.4771 times
10:44 PM <abhiramr>  if the no of input increases by 3 times the running time increases by 0.605 times
10:44 PM <tushara> if the no of input increases by 5 times the running time increases by 0.69897 time
10:44 PM <fierch> good
10:44 PM <abhiramr>  if the no of input increases by 4 times the running time increases by 0.602 times
10:44 PM <tushara> if the no of input increases by 4 times the running time increases by 0.6020599 time
10:44 PM <abhiramr>  if the no of input increases by 5 times the running time increases by 0.6989 times
10:45 PM <abhiramr>  if the no of input increases by 5 times the running time increases by 0.7781 times
10:45 PM <abhiramr>  if the no of input increases by 6 times the running time increases by 0.7781 times
10:45 PM <tushara> if the no of input increases by 6 times the running time increases by 0.77815 times
10:45 PM <abhiramr>  if the no of input increases by 7 times the running time increases by 0.8451 times
10:45 PM <tushara> if the no of input increases by 7 times the running time increases by 0.84509 times
10:45 PM <abraar> If no of inputs increase by 8 times the running time increases by .9030 times
10:45 PM <abhiramr>  if the no of input increases by 8 times the running time increases by 0.9031 times
10:45 PM <tushara> if the no of input increases by 8 times the running time increases by 0.90308 time
10:45 PM <abhiramr>  if the no of input increases by 10 times the running time increases by 1 times
10:46 PM <tushara> if the no of input increases by 9 times the running time increases by 0.95424 time
10:46 PM <karthic_> ok good
10:46 PM <karthic_> now here is my question
10:46 PM <karthic_> answet them one by one
10:46 PM → carnal joined (guest-carn@conference/jsconf/x-ihxndbvshmbgpetd)
10:46 PM <carnal> sup mofos?
10:47 PM <fierch> abhiramr: note down
10:47 PM <karthic_> in case of an algorithm with complexity 'theta of N ' , now many times did the running time increase when the number of inputs increased by 10 times ??
10:47 PM <karthic_> how many*
10:47 PM <abhiramr> carnal: Please refrain from using profanity,
10:47 PM <abraar> 10 times
10:48 PM <tushara> 10
10:48 PM <abhiramr> 10
10:48 PM <karthic_> in case of an algorithm with complexity 'theta of N  square' , how many times did the running time increase when the number of inputs increased by 10 times ??
10:48 PM <hackdroid> 100
10:48 PM <ark101> 100
10:48 PM <tushara> 100
10:48 PM <karthic_> in case of an algorithm with complexity 'theta of logN to base 10' , how many times did the running time increase when the number of inputs increased by 10 times ??
10:48 PM <abhiramr> 1
10:48 PM <tushara> 1
10:49 PM <hackdroid> 1
10:49 PM <karthic_> so which is the better algorithm ??
10:49 PM <hackdroid> log
10:49 PM <abhiramr> one with logN complexity
10:49 PM <ark101> last one
10:49 PM <karthic_> algorithm with the complexity theta of LogN or theta of N ??
10:49 PM <tushara> last one
10:49 PM <hackdroid> logN
10:49 PM <tushara> log(n)
10:50 PM <abraar> LogN to base 10
10:50 PM <Abhishek_Jain> log n
10:50 PM <Abhishek_Jain> sorry net went out
10:50 PM ← carnal left (guest-carn@conference/jsconf/x-ihxndbvshmbgpetd)
10:51 PM <Abhishek_Jain> log n is way better than n as its a exponential graph
10:51 PM <Abhishek_Jain> correct me if i am wrong
10:52 PM <karthic_> now which amongst this is better ?? Algorithm with time complexity 'theta of N' or 'theta of n square' ??
10:52 PM <fierch> theta of N
10:52 PM <abhiramr> theta of N
10:52 PM <tushara> theta of n
10:52 PM <Vaishnavi> Theta of n
10:52 PM <fierch> @vaishnavi2
10:53 PM <karthic_> good
10:53 PM <karthic_> all of you are right
10:53 PM <karthic_> lets say we have a 2 sorting algorithm ..
10:53 PM <karthic_> one is X and another is Y
10:53 PM <tushara> ok
10:53 PM <karthic_> the time complexity of X is 'theta of logN' and Y is 'N' which one is better ??
10:54 PM <tushara> x
10:54 PM <tushara> *X
10:54 PM <abhiramr> X
10:54 PM <ark101> X
10:54 PM <Abhishek_Jain> X
10:54 PM <Vaishnavi> X
10:55 PM <karthic_> now , which of these are better 'theta of LogN' or 'theta of NlogN'
10:55 PM <karthic_> ??
10:56 PM <Abhishek_Jain> theta of log n
10:56 PM <Vaishnavi> Log n
10:56 PM <tushara> theta logn
10:56 PM <abhiramr> I don't know.
10:56 PM <Vaishnavi> Theta log n*
10:57 PM <karthic_> yes
10:57 PM <karthic_> al of u r right
10:57 PM <ark101> first one
10:57 PM <karthic_> now again there are 2 sorting algorithms , A and B
10:57 PM <Abhishek_Jain> theta Nlogn will be more take more than theta of logn
10:58 PM <Abhishek_Jain> theta Nlogn take more than theta of logn*
10:58 PM <karthic_> the time complexity of A is 'theta of N square and the time complexity of B os 'theta of NLogN' , which of these are better
10:58 PM <karthic_> ??
10:58 PM <Vaishnavi> N log n
10:58 PM → palike1 joined (guest-pali@conference/jsconf/x-vjccnfeaoqifcdos)
10:58 PM <Abhishek_Jain> theta of nlogn
10:58 PM <palike1> depends on n
10:58 PM <abhiramr> one second
10:58 PM <abhiramr> I didn't get the previous analogy
10:58 PM <karthic_> ltes say for large inputs
10:58 PM <Abhishek_Jain> yea actually depends on n...for small values n square
10:59 PM <karthic_> @alike:large no of inputs
10:59 PM <abhiramr> How's n logn not better than log n ?
10:59 PM <Abhishek_Jain> large values theta of nlogn will be efficient
10:59 PM <tushara> nlogn
10:59 PM <karthic_> NlogN is better than N square for decent no of inputs
10:59 PM <tushara> coz logn is smallest....if thats multiplied ny n, its obvi larger than nlogn
11:00 PM <Abhishek_Jain> 2abhiram consider a value of n and try to check.. correct me if i am wrong
11:00 PM <palike1> well nlog(n)= log(n^n)
11:00 PM <palike1> so for small values nlog(n) is smaller than n^2
11:00 PM <Abhishek_Jain> Palikel +1
11:01 PM <tushara> awesome
11:01 PM <karthic_> @palike +1 , thank you for volunteering yourself for this initiative
11:01 PM <palike1> chetusa.. :P using guest acc
11:01 PM <karthic_> welsome to the group
11:01 PM <karthic_> lol !
11:01 PM <karthic_> okay
11:01 PM <karthic_> lets continue
11:02 PM <karthic_> so algorithm with complexity 'theta of NLogN' is better than algorithm with complexity 'theta of N square ' in general
11:02 PM <karthic_> do you guys agree ??
11:02 PM <abhiramr> palike1: +1. got it
11:02 PM <karthic_> how many +1 ??
11:02 PM <abhiramr> +2
11:02 PM <abhiramr> * +1
11:02 PM <tushara> +1
11:03 PM <Vaishnavi> +1
11:03 PM <Abhishek_Jain> +1
11:03 PM <Abhishek_Jain> i already gave him one :P
11:03 PM <ark101> +1
11:04 PM <karthic_> thats why 'Merge Sort is better sorting algorithm than bubble sort '
11:04 PM <karthic_> because the worst time complexity of merge sort is 'NLogN' whereas of the bubble sort is 'N square'
11:05 PM <Abhishek_Jain> @karthic cool
11:05 PM <Abhishek_Jain> :P
11:05 PM <tushara> yes average case too
11:05 PM <karthic_> so merge sort is way better sorting algo compared to bubble sort for sorting large number of inputs
11:05 PM <tushara> @karthic +1
11:05 PM <Vaishnavi> +1
11:06 PM <abhiramr> karthic_: Can we have fixed slots for the session? It's 11 and people might have to sleep.
11:06 PM <fierch> he wants to sleep :p
11:07 PM <karthic_> take your calci and do a simple calculation for 1000 inputs , N square = 1000 square and NlogN = 1000log1000 , c the difference , the difference gets bigger for larger and larger inputs ,
11:07 PM <palike1> 1000^2=1000000
11:07 PM <karthic_> so even if you have a good computer its of no use if you run a crappy algorithm when you have huge number of inputs
11:07 PM <palike1> 1000log(1000) is 100000
11:07 PM <tushara> no its 3000
11:07 PM <Abhishek_Jain> 3000
11:07 PM <palike1> base?
11:08 PM <palike1> crap!
11:08 PM <Abhishek_Jain> base 10
11:08 PM <palike1> correct
11:08 PM <tushara> base 10
11:08 PM <palike1> 3000
11:08 PM <palike1> my bad...
11:08 PM <karthic_> base 2 is generrally used in divide conquer algos
11:08 PM <palike1> lol!
11:08 PM <karthic_> u r supposed to use base 2
11:08 PM <tushara> oh ok
11:08 PM <karthic_> but still thousands of times of difference
11:09 PM <karthic_> that is only for 1000 inputs , now lets for 1 million inputs
11:09 PM <karthic_> it makes a huge difference right ?
11:09 PM <karthic_> how many +1 ?
11:09 PM <tushara> +1
11:09 PM <ark101> +1
11:09 PM <abhiramr> yeah +1
11:09 PM <karthic_> the discussion will go on for 10 more min
11:09 PM <Abhishek_Jain> +1
11:10 PM <Vaishnavi> +1
11:10 PM <abhiramr> fierch: Not really, just structuring the sessions. :)
11:10 PM <karthic_> so now given the time coplexity of 2 algorithms you guys can say which one is better , possible right ??
11:11 PM <karthic_> complexity*
11:11 PM <fierch> yes
11:11 PM <Vaishnavi> Kinda
11:11 PM <abhiramr> yeah
11:11 PM <Abhishek_Jain> yea
11:11 PM <karthic_> now ill ask yes no questions
11:11 PM <karthic_> i ant the answer
11:11 PM <karthic_> want*
11:11 PM <fierch> ok
11:11 PM <karthic_> answer should be yes or no
11:12 PM <Abhishek_Jain> ok cool
11:12 PM <Abhishek_Jain> that will be fun
11:12 PM <karthic_> 'theta of N' is better than 'logN'
11:12 PM <karthic_> whos first
11:12 PM <karthic_> ?
11:12 PM <abraar> No
11:12 PM <Abhishek_Jain> logn
11:12 PM <karthic_> abraar won
11:12 PM <ark101> no
11:12 PM <abraar> Yes :p
11:12 PM <Vaishnavi> N
11:12 PM <Abhishek_Jain> no
11:12 PM <Vaishnavi> No
11:12 PM <karthic_> next question
11:12 PM <karthic_> lets c who asnwers first
11:12 PM <palike1> no
11:13 PM <abraar> Yes..for i won..no is the answer
11:13 PM <Abhishek_Jain> karhic next ques
11:13 PM <karthic_> 'theta of N square ' is better than 'theta of NlogN' for large no of inputs
11:14 PM <Abhishek_Jain> no
11:14 PM <ark101> no
11:14 PM <tushara> no
11:14 PM <karthic_> abhishek wins
11:14 PM <Vaishnavi> N
11:14 PM <abhiramr> no
11:14 PM <Abhishek_Jain> yay
11:14 PM <palike1> no
11:14 PM <Vaishnavi> No
11:14 PM <karthic_> next question
11:15 PM <karthic_> 'theta of n square ' is better than 'theta of n cube'
11:15 PM <palike1> yes
11:15 PM <Abhishek_Jain> yes
11:15 PM <Vaishnavi> Ye
11:15 PM <fierch> yes
11:15 PM <tushara> @palike1 yes
11:15 PM <ark101> yes
11:15 PM <abhiramr> yes
11:15 PM <palike1> wait
11:15 PM <palike1> for small or big inputs
11:15 PM <palike1> ?
11:15 PM ⇐ Kishan_Gupta quit ([email protected]) Ping timeout: 240 seconds
11:15 PM <palike1> for small no
11:15 PM <karthic_> @palike wins
11:15 PM <palike1> for large inputs yes
11:15 PM <karthic_> foral possible inputs
11:15 PM <tushara> yes for all...
11:15 PM <tushara> inputs
11:16 PM ⇐ the_codebot quit ([email protected]) Ping timeout: 255 seconds
11:16 PM <fierch> palike1 explain
11:16 PM — abhiramr imagines everyone wide-eyed waiting for the question
11:16 PM <karthic_> n cube is always smaller than n square  - mathematical induction
11:16 PM <palike1> oh.. number of inputs..
11:16 PM <karthic_> thats all
11:16 PM <karthic_>  no questions :D
11:16 PM <palike1> my bad..
11:16 PM <Abhishek_Jain> oh
11:16 PM <palike1> @karthic not the input itself..
11:16 PM <palike1> :P
11:16 PM <karthic_> lsat 5 min
11:16 PM <Abhishek_Jain> this much only
11:16 PM <fierch> abhuram  lol
11:16 PM <karthic_> last 5 min
11:17 PM <karthic_> no given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:17 PM <fierch> tomorrow's assignment? :P
11:17 PM — palike1 remembers the same statement fmr y'day
11:17 PM — abhiramr thanks fierch for killing my name
11:17 PM <karthic_>  now, given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:17 PM — fierch accepts
11:17 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:17 PM <palike1> yes or no> O.o
11:17 PM <tushara> 3 loops...i guess no!!
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM <Abhishek_Jain> yea tushara one way
11:18 PM <fierch> karthic, only if there is no other way of designing
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM → viggy_prabhu joined ([email protected])
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM <tushara> depends!!!
11:18 PM <tushara> oye
11:18 PM <karthic_>  now given a chance to design algorithms how many of you want to design algorithm of complexity 'theta of N cube' ??
11:18 PM <palike1> how is that yes or no?
11:18 PM <Abhishek_Jain> i would like to @karthic
11:18 PM <abhiramr> no
11:18 PM <Vaishnavi> Obvi no
11:18 PM <tushara> i told my answer
11:18 PM <ark101> no way
11:18 PM <abhiramr> why would anyone want an algo with n^3 complexity
11:18 PM <karthic_> the asnwer is if there is better way its not good to design algorithm of theta of n cude complexity
11:18 PM <tushara> this guy posted the question again n again
11:18 PM <palike1> nope.. not me..
11:19 PM <fierch> yeah, that's what
11:19 PM <Abhishek_Jain> oh i thgt he told to try ..oops my fault
11:19 PM <fierch> if there's no better way, you will have to design n^3 complexity algos
11:19 PM <karthic_> try if you can reduce the time complexity to 'logN'
11:19 PM <karthic_> if not possible then ti 'NlogN'
11:19 PM <karthic_> if not possible then atleast to 'N'
11:20 PM <fierch> then n^2
11:20 PM <karthic_> if not then atleast to 'N square'
11:20 PM <fierch> then n^3
11:20 PM <Vaishnavi> If none n^3
11:20 PM <karthic_> sry 'NlogN' should come after 'N'
11:20 PM <karthic_> yes
11:20 PM <fierch> how about 2^n?
11:20 PM <fierch> 2^n algos
11:20 PM <palike1> exponential
11:20 PM <karthic_> if not anything you have to go for something that works atleast
11:21 PM <karthic_> at the end go for exponential algos
11:21 PM <Vaishnavi> N^3 is betta than 2^n
11:21 PM <karthic_> here is the question
11:21 PM <palike1> true
11:21 PM <palike1> @vaishnavi2
11:21 PM <fierch> vaishnavi, how?
11:21 PM <Abhishek_Jain> yea how?
11:21 PM <karthic_> n^3 is better than 2^n
11:21 PM <tushara> 2^n is worst!! for large inputs
11:21 PM <Abhishek_Jain> check for 2^3 and 3^3
11:21 PM <palike1> 2^n is exponential.. :P
11:21 PM <karthic_> try for larger inputs
11:22 PM <palike1> the graph
11:22 PM <Vaishnavi> Subs n compare
11:22 PM <fierch> okay, yeah.
11:22 PM <fierch> for large inputs.
11:22 PM <Abhishek_Jain> ohk :)
11:22 PM <fierch> okay, exponential is the least preferred
11:22 PM <Vaishnavi> Fac actually
11:23 PM <abhiramr> Vaishnavi: Just try on your calci
11:23 PM <karthic_> here is the question for tomorrow
11:23 PM <abhiramr> 2^100 and 100^3
11:23 PM <abhiramr> you'll know the answer :)
11:23 PM <Vaishnavi> Yea it doesn't go tat way
11:23 PM <palike1> The Graph
11:24 PM <palike1> *graphs
11:24 PM <palike1> compare them
11:24 PM <fierch> karthic go ahead
11:24 PM <Vaishnavi> Graphs
11:24 PM <Vaishnavi> My bad
11:24 PM <palike1> and wolla! u have the comparison..
11:24 PM <karthic_> "given the time complexity you guys now which algorithm is better .....But given the algorithm , how do you find its time complexity ??"
11:24 PM <Vaishnavi> Hey wait
11:24 PM <karthic_> thats the question
11:24 PM <tushara> okay
11:25 PM <Abhishek_Jain> ok
11:25 PM <palike1> cool!
11:25 PM — abhiramr is up for the challenge
11:25 PM — tushara loves this ;)
11:25 PM — Abhishek_Jain thinks he know the answer
11:25 PM <karthic_> "given the time complexity you guys now which algorithm is better .....But given the algorithm , how do you find its time complexity ??" and you should find the time complexities for bubble sort and insertion sort and please watch the 4th video
11:26 PM <palike1> cool! :)
11:26 PM <tushara> okay....sure
11:26 PM <karthic_> we shall start implement bubble sort using python tomorrow
11:26 PM — fierch wondering when will we start implementing algos on python
11:26 PM <palike1> awesome... :D
11:26 PM <fierch> oh, good timing
11:26 PM <karthic_> u guys got the question right ?
11:27 PM <Abhishek_Jain> yea we got it
11:27 PM <tushara> see you all tomorrow @10 here!! (with the answers and some race ;) :p)
11:27 PM <karthic_> any questions abt the question ?? :D
11:27 PM <fierch> lol
11:27 PM <Abhishek_Jain> lol no
11:27 PM <tushara> no
11:27 PM <palike1> nope
11:27 PM <karthic_> how was the discussion today ?? satisfactory ?
11:28 PM <Vaishnavi> More than that. :D
11:28 PM <palike1> really good... frm what i followed...
11:29 PM <palike1> :)
11:29 PM <abhiramr> Good!
11:29 PM <palike1> *where
11:29 PM <karthic_> i repeat the question , "given the time complexity its easy to say which algorithm is the better one , but given an algorithm how do you find its time complexity ?? go through the algorithms for bubble sort and insertion sort and find their time complexities "
11:29 PM <abhiramr> Just give an attendance like this and we'll end the session
11:29 PM <abhiramr> Abhiram R
11:30 PM <karthic_> karthic rao
11:30 PM <palike1> Chaitanya.S.A
11:30 PM <Vaishnavi> Vaishnavi Rao
11:30 PM <fierch> James Bond
11:30 PM <palike1> lol!
11:30 PM <karthic_> ok , abhiram , make a log
11:30 PM <Abhishek_Jain> Abhishek Jain
11:30 PM <ark101> Arpitha Kashyap
11:31 PM <abhiramr> < ---- SESSION 3 END ---->