List of Comments

ok, btw it is not true that would be a memory leak in c++... It depends how you translate it in c++. I don't know c#, but i don't see 'value' being a pointer... 'value' is always on the same memory... as long as the assigned result from the rand operation fits its type, you can cycle as many times you want and assign some number to it. This would be a memory leak if 'value' was a pointer of course, since there is no delete. if there was something like that: while(expr){ long *value = new long; value = randomizingFoo(); } yes, you could have a memory leak...

Why would you do it like that? Why would you even need a random or pseudo-random result ? You want it to be unique so you could just have a static LastIDGiven that will increase with every given ID and you would just make _ID = ++LastIDGiven and then add _ID to IDList .

Frequently Asked Core Java Interview Questions and Answer I was searching for some java questions and answers, where my java queries has been resolved in very short span of time.

http://www.tempest-sw.com/benchmark/pi.c

Would you please show us the source code of all language that you had demonstrate here? It is really interesting that you mentioned pure C is faster than CPP since C is also valid in CPP and VS compiler (as my understanding) is a CPP compiler.

Delphi still produces high quality code. I write C/C++, C#, Python, Delphi, PHP code and here are some links for Delphi 🙂 http://isdelphidead.com http://arstechnica.com/civis/viewtopic.php?f=20&t=1261959 http://benchmarksgame.alioth.debian.org/

The website can say what it wants, but there hasn't been a commercially published Delphi book in 10 years, it's gone from schools for 16 years, there are almost no conferences, there are no magazines, no free online courses, a paltry amount of 3rd party libraries, other software no longer makes it easy to interface with Delphi, in most countries there are no Delphi jobs, etc. It costs far, far, far too much (especially in the age of open source) to be used by hobbyists, and the quality and policies are too low to be used for enterprise. Once upon a time it was much easier to program GUI applications than C++ and MFC, but nowadays there is C#, Qt, Coco, Gtk, etc. and much desktop software has now moved to the browser anyways. RAD belongs to Ruby and Python, and the Delphi compiler generally benchmarks at 1/2 the performance of C++ code in benchmarks and even gets beaten in single-threaded benchmarks by Java! There really isn't a niche it fills anymore other than maintaining legacy Delphi software.

you could do cout

Very nice code. It helped me a lot to understand recursive function. What if I wanted to print on the screen, the number of possible combinations , instead of the combinations itselves ? In this example with 5 and 3, how could the program print " the possible combinations are 10 "

Solution in java : public static void main(String[] args) { long start = System.nanoTime(); System.out.println(oneInt(98654)); long end = System.nanoTime(); System.out.print(end - start); System.out.println(" nano second"); } public static int oneInt(int integer,int size){ if(size==1) return integer; String temp = integer+""; integer=0; for(char t : temp.toCharArray()) integer+= t - '0'; return oneInt(integer, String.valueOf(integer).length()); } public static int oneInt(int integer){ return oneInt(integer,String.valueOf(integer).length()); } result: 5 251033 nano second BUILD SUCCESSFUL (total time: 0 seconds)

Hi, this is great information about WiFi Repeater and Powerline Adapter. There are several features of Powerline Adapter. Thanks for share with us.

Excellent! Thank you!

Did that for myself with the french version. Code is very similar. If you ever happen to be interested, see here: https://gist.github.com/duckie/3239429

How do you display more than one sprite on the screen

yes, you are more accurate. thanks.

1. You are using a HashTable to store the 3D grid, but that is not necessary here. Use a HashSet instead, since you only need a hashed set of list items. 2. One of the reasons the first algorithm is not optimal is, its executing Math.Pow function many times as its in a O(n ^ 2) loop. 3. Another reason here, it is not memory efficient because it is creating a new list every time the loop is iterated 4.Second code is also not that memory optimal because, in the first loop you are creating a new Point3F and assigning it to currentPt, instead you could be doing "currentPt = cur;" 5.Basically based on your code, your problem is not correctly stated, it shouldn't be "any of two points have distance more than the specified distance" it should be "list of points which are at least resolution distance far away from any other point in the data set". 6.Let me me know if I am wrong.

blah blah blah blah

thank’s. it works.

you can store the indices when you do the max() selection along the scan.

how to print indexes of robbed houses??

how to print indexes of robbed houses

我的九妹已放弃治疗。。。

这简直是帅呆了2333333333

It looks like Windows 10 for mobile phone is not yet ready..

wouldn't an ordered set be faster than an unordered one. i.e. order log2N rather than N/2