Author: PH

Into Research and Writing!
General Discussions

Floyd’s Algorithm – C Implementation

PHLeave a comment

Originally posted on PH Bytes:
All pair shortest path algorithm (Floyd) , C implementation is below. Also available in Github here. #include #include int main() { int n = 4; int i, j, k; int D[5][5] = { {0, 0, 0, 0, 0}, {0, 0, 999, 3, 999}, {0, 2, 0, 999, 999}, {0, 999,…

General Discussions

Handy Codes Library

PHLeave a comment

Every one should have a code library which has all the basic things implemented. Specially those into competitive programming. Use it at required rather than going from scratch. I have started one and its eventually growing. I have kept it open on github, public, and is available here: Day Today Codes Its small yet and… Continue reading Handy Codes Library

General Discussions

Keeping IT Simple

PHLeave a comment

Research challenges are always exciting. They come with an experience of –  “Not knowing where to start”. Well, that’s an amazing experience because we can start anywhere. When we look at what we have, very easily, our mind will point to think something complicated. Some complicated procedure that is not easy. But, a lot of… Continue reading Keeping IT Simple

General Discussions

Knit Arena

PHLeave a comment

I would like to keep this short as an introductory post. More details here: Knit Arena. More to follow soon.

General Discussions

Multiples of 8

PHLeave a comment

Originally posted on PH Bytes:
To check if the number is multiple of 8, the bitwise way is that: first right shift by 3 and then left shift by 3. Multiple of 8 will remain the same as original number after this operation. Examples: 8:        1000 >> 3 :  0001 <<3  : …

General Discussions

Floyd’s Algorithm – C Implementation

PH1 Comment

All pair shortest path algorithm (Floyd) , C implementation is below. Also available in Github here.