about 3 weeks ago - 5 comments
I’m going to make a simple point. And because people that know me think I’m a “unfair-Google-aficionado-that-doesn’t-see-how-evil-Google-is”, I’m going to use Android as victim here.
iPhone ruleZ
Other OS? I’m not even taking into consideration old stuff like Symbian: is just too easy to trash it now-days (Qt is a whole different story though).
Android is great… for [...]
about 1 month ago - No comments
Imagine you have a Binary Tree, with those characteristics:
Nodes do not respect any order relation – In other words: it’s not a Binary Search Tree of any kind
Every node appears once and only once within the tree
A nice Binary Tree
Then, your little brother passes by your desk and, to upset you, deletes the tree from [...]
about 1 month ago - 6 comments
This idea comes out for an old university-time idea: to write a serverless chat application. Of course, I’m aware of the complications and the problems that using Broadcasting could create, so this problems would be took in consideration by design.
But why now? I was thinking of a way to reduce the “office distances”: making easy [...]
about 1 month ago - No comments
Another small problem before I go to sleep tonight:
There is an array A[N] of N numbers.
You have to compose an array Output[N] such that Output[i] will be equal
to multiplication of all the elements of A[N] except A[i].
For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1]
will be multiplication of A[0] and from A[2] [...]
about 1 month ago - No comments
I’m “studying” this algorithmic technique: Backtracking. This is an algorithmic approach to problem solution that I trust every good Computer Scientist already uses; but taking a good theo-practical look at it is something better.
A Backtracking Tree
I believe you can find enough informations about it online (the 2 links I provided are more than enough), so [...]
about 1 month ago - 7 comments
This is a classical problem of Computer Science: it’s used to study both Greedy and Dynamic Programming algorithmic techniques.
I hate having my pocket full of copper!!! -_-
Definition
Given:
A set of n Denominations D[0...n-1] in ascending order, representing a Monetary Coin System
An money amount A, as input
calculate a solution:
S[0...n-1], with 0 <= S[i] <= (A/S[i]) and 0 [...]
about 2 months ago - 4 comments
For this you need someone to teach it to you: if you made it yourself, then you are a very good Comp-Sci, and you should send your CV to Google ASAP.
Without branching O_o?
Yes, without using any “if ( a < 0 )…”. To do that, you need to refresh how Two’s Complement works, [...]
about 2 months ago - No comments
What’s Pascal’s Triangle? That’s what it is (Wikipedia has all the theory, if you need).
Pascal’s Triangle first 6 rows
The thing I wrote here is a generator of the n-th row of the triangle, that doesn’t use more then the memory needed to store the solution. Instead of allocating a Triangular Matrix, and building every row [...]
about 2 months ago - 2 comments
Searching a string inside another string is a very easy task. Given a string A and a string B, start a loop over A from left to right and, for every letter, start an internal loop to see if there is a match with the letters of B.
A ball of string
Pseudo code would look something [...]
Twitter
Facebook
Google
Anobii
GitHub
LinkedIn
about 2 years ago
Uhm, I’m kinda worried! we are used to have lunch together so…
you talkin’ to me?
you talkin’ to me?
Seriously speaking…I know what you mean, man!!!
about 2 years ago
Ma non sarebbe:
“Are you talkin’ to me?”
about 2 years ago
Ivan, un cinefilo come te. Ma come.
È la battuta di De Niro in Taxi Driver. E dice proprio così. Tra la grammatica e la parlata comune, soprattutto americana, ce ne passa.
@luca: nel film lo dice tre volte
about 2 years ago
Vuoi sapere cosa odio?
Quando le persone dicono frasi STRA-COMUNI su argomenti STRA-COMUNI e lo dicono seriamente, come se fosse detto per la prima volta! ARGH!
about 2 years ago
@Nemo: Mai visto! -_-
@Manu: eh?
about 2 years ago
@Manu: L’ho capita ora.
Avevo il Cervello appilato (piu’ del solito almeno).