• Home
  • Github
  • youtube
  • wishlist
  • About
  • Contact
FJ
Software Engineering, Sport, me!

Programming

  • C++
  • ...
    • Programming
    • C++17

C++17: let’s have a look at the constexpr if

Posted on 29 July 2016by Filip Janiszewski

There was a long discussion in the C++ community about when and how to implement the static if, the original proposal from Bright, Sutter and Alexandrescu which was aiming to define a possible implementation of this feature was resurrected after a quite long silence, just to be included in the upcoming C++17. The actual implementation of the […]

Read More
No comments yet
  • Algorithms
  • ...
    • C++
    • Programming
    • Short Story

Disjoint-set or Union-find?..

Posted on 20 June 201614 January 2017by Filip Janiszewski

I wasn’t planning any post this week, I don’t have that much free time to write posts. But I was forced to write down my own implementation of a disjoint set data structure for the purpose of one of the projects I’m working on, so I thought why not share this piece of code with […]

Read More
No comments yet
  • assembler
  • ...
    • bug
    • C++
    • compilers
    • Programming
    • Quality

Unexpected stuff!

Posted on 3 June 2016by Filip Janiszewski

Let’s have a look at this code: int main() { for(int i{0};i<500;i++) { std::cout<<“This is a big number: “<<i*20000000<<std::endl; } } And let’s compile it with g++ using the flag -O3, what’s going to happen? Before answering, let’s have a look at the assembly, shall we? L16: movsbl 39(%ebx), %eax L6: movl %esi, %ecx movl […]

Read More
No comments yet
  • Algorithms
  • ...
    • blog
    • C++
    • Programming

Segment tree

Posted on 31 May 2016by Filip Janiszewski

What is the best thing you may possible do when having a eight hours train trip? Writing a blog post of course! That’s actually an interesting story by itself: Where I was and why it take that long to come back home! Anyway! Let’s say you’ve an array of integers, as usual from index 0 to […]

Read More
No comments yet
  • assembler
  • ...
    • C++
    • compilers
    • Programming
    • Short Story

Almost useless knowledge

Posted on 17 May 2016by Filip Janiszewski

Is almost useless because nobody is going to raise yours salary for that! Or maybe someone will?!? Let’s say we ignore all the benefits of all the optimizations our benevolent compiler is going to made on our code, and have a look at what happen when we execute some hundreds of thousands of times two very […]

Read More
No comments yet
  • Algorithms
  • ...
    • blog
    • C++
    • Programming

Solution space.

Posted on 7 May 2016by Filip Janiszewski

Certain problems required us to try all the possible solutions to find the one that best fit the given constraint, a very popular brute force way is to perform a complete search of the solution space by iterating over and over the data and changing each time the input variables. If the problem require to […]

Read More
No comments yet
  • Algorithms
  • ...
    • Books
    • Programming
    • Short Story

Suffix trees.

Posted on 22 April 2016by Filip Janiszewski

An entire post covering both the theoretical part and the implementation is going to take too long, for this reason I’m splitting the material in two parts: A post with some theory introduction, and one post which will be focused on implementation details. The algorithm I would like to show you is the Ukkonen method for […]

Read More
1 Comment
  • Algorithms
  • ...
    • C++
    • Programming
    • Quality

String searching algorithms comparison.

Posted on 3 March 2016by Filip Janiszewski

With nature OPHELIA sick had. heel him my MARCELLUS the A with my in comes not sweet if! A means may too; that quantity prepare did! have would not thou But do; thirty fortune, lament And are A of and havior There and. QUEEN am What worse kind. at might at wears that as That […]

Read More
1 Comment
  • Books
  • ...
    • C++
    • Combinatorics
    • Programming
    • Short Story

Summary for the week.

Posted on 13 February 2016by Filip Janiszewski

This was a very long week! Most of my free time I was at the gym or on my combinatorics book learning fancy details about the pigeonhole principle, which is very simple but with large implications in problem solving. The pigeonhole principle basically say that if you want to put three pigeon in two holes, […]

Read More
No comments yet
  • Algorithms
  • ...
    • C++
    • Combinatorics
    • Programming

Subsequences and Fenwick tree’s

Posted on 8 February 2016by Filip Janiszewski

Let’s say that we have a sequence A of 1<=n<=10^5 elements, and that this sequence may or may not be ordered but all the numbers {1…n} are present exactly once. And now given 1<=k<=10, you’re asked to find all the increasing sub-sequences of A with exactly k+1 elements. This is a problem I get from a competitive programming […]

Read More
No comments yet

Posts navigation

Older posts
Newer posts

Linkedin

Recent Posts

  • Including DPDK libs into your C++ project
  • How to use the MySQL X DevAPI PHP extension
  • MySQL Document Store and the X DevAPI extension for PHP!
  • The Kdb+ database, K and Q.
  • C++17: Structure binding

Categories

  • Algorithms (17)
  • assembler (2)
  • blog (16)
  • Books (8)
  • bug (1)
  • C++ (13)
  • C++17 (6)
  • Combinatorics (6)
  • compilers (4)
  • Corporate (3)
  • corporation (1)
  • DB (2)
  • Functional Programming (1)
  • holiday (3)
  • Italiano (1)
  • me (11)
  • MySQL (2)
  • opengl (4)
  • PHP (1)
  • Programming (26)
  • Q (1)
  • Quality (5)
  • Running (4)
  • Scala (1)
  • Senza categoria (1)
  • Short Story (24)
  • Sport (6)
  • Tools (2)
  • Training (4)
  • Uncategorized (1)
Filip Janiszewski Theme by Colorlib Powered by WordPress