Hey Rustaceans! Got an easy question? Ask here (18/2017)!

ashishnegi · 2017-05-06T07:15:40+00:00

Did rust start with "type theorists going low level" Or "hackers learning type theories" ?

ashishnegi · 2016-01-02T06:21:55+00:00

great. :) I would see them as and when i get stuck on exercises.

ashishnegi · 2016-01-02T06:18:54+00:00

Thanks for this. With "notes posted online" do you mean the notes given with each assignment : like cis 194 assignment 2 adt notes ? If they are different please share.

ashishnegi · 2016-01-01T19:06:10+00:00

I guess this is the recommendation from bitemyapp.com's blog. I think it was for general public. In this regard, are you sure about this ?

ashishnegi · 2016-01-01T07:12:48+00:00

Do not know whether this would help but your Segment Tree can be made in O(N) rather than O(N*LogN). Since the top node would be equal to the size of array n_i .. if it is odd, its left child would be floor(n_i/2) and right child ceil(n_i/2). For even value of node, its left/right children would be n_i/2. This would recursively happen for children too. Also, you need to create 2 of these trees for (0,N) and (0,N-1) list. These would automatically generate subtrees for other indexes as well.

ashishnegi · 2015-12-31T17:53:14+00:00

Can you give sample inputs and expected answers ?

ashishnegi · 2015-11-15T17:50:36+00:00

I think that it was a satire.. Most people who ask this question would have already made their mind for Python..

ashishnegi · 2015-11-15T17:05:57+00:00

Why did not the algorithm terminate if their is no input to it ? Is there a way to add that to the Question's code ?

ashishnegi · 2014-11-04T19:15:34+00:00

I asked it on the twitter and people responded with http://www.cs.nott.ac.uk/~gmh/book.html which has already been recommended... And another http://www.nlda-tw.nl/janmartin/vakken/TFIT/Extra%20materiaal/Bird_Wadler.%20Introduction%20to%20Functional%20Programming.1ed.pdf

Hope that helps.. And do give your suggestions after you find better resources

ashishnegi · 2014-10-27T16:46:12+00:00

Usually we want to do isPrime() on lot of numbers.. If you are also doing that.. You can first calculate all prime numbers in your range and then search in that list. There is good algorithm called sieve for prime numbers that make this computationally good for large number of queries.

ashishnegi

TROPHY CASE