#kadane

[kaia1011]

WOOOOT!!! I am not yet dead. Here’s a before and now pic :D I started the first one when I just got my tablet and the second one is the one I did xx years later :) While I wanted to keep the basic elements of the drawing and the girl’s design, I really wanted more movement in the recent drawing. 

[memoireneuve]

The New Year - Recent History

Plus de 8 ans après leur troisième album et leur dernière venue en France, The New Year revient sous forme de quatuor avec un nouvel album, “Snow”. Pour mettre en appétit, le groupe propose ce “Recent History” qui se glisse sans peine dans le top 5 des chansons du groupe. Le temps passe mais la voix nonchalante de Matt Kadane, la simplicité et les lignes mélodiques brevetées “Frères Kadane-Bedhead-The New Year” font toujours autant mouche.

[kaia1011]

|| C A N D Y P O P ||

Just felt like drawing Miku :) 

EDIT: Made her hair blue-er because my laptop display is different from other screens 

[fuckyeahdisneyfanart]

[alismanifesto-blog]

Kadane's Algorithm

Yes. It's been a long time. But some times we just need to return to the beginning to remember what we forgot. Ah, well, the blog was started when I joined college, it is kinda poetic that I should re-begin it considering I am at the very last league of the Great Indian Rat-Race.

What got me back, well that includes Rupal's constant request to write something, me exhausting my Hard Disk for good movies to watch and a constant boredom that has prevailed over me these past few days.

Ok Let's talk about what this post is about- "Kadane's Algorithm"

It's an algorithm to find the maximal sub array for a given array. Maximal Sub array means that a sub set of an array which has the maximum sum.

The Algo works in linear time, i.e. O(n). Which basically boils down to saying that we just have to traverse the array only once.

Kadane's is such a simple approach to the most common array problem.

Let A[0 ... n-1] be an array of integers, we find the current sum till each element in the array starting from the left and going till the end and we keep on comparing it with a maximum sum so as to change the maximum sum when the current sum exceeds it.

// <![CDATA[ // ]]>

This is a the most simple Dynamic Programming problem.

Note: It will return 0 when array consists of all negative numbers.

Also why write about this ? Well that is cause I found it too beautiful. The simplicity of it amazed me and I wanted to share this piece of information.

[soul-dwelling]

Spring Rain by ~Kadane

[jasonpanella]

It's Friday, so I give you not one but two E-bows in action.

[unassailable-pull]