a bit of cs

an exploration on computer science and mathematics

Sunday, November 15, 2020

in-place merge sort (sort of)

›
So I just saw this discussion  https://stackoverflow.com/questions/2571049/how-to-sort-in-place-using-the-merge-sort-algorithm  and I think ...
7 comments:
Sunday, June 2, 2019

Merging heaps in O(log N)?

›
Can you merge two heaps in O(log N)? Turns out if they are leftist heaps, you can! But what is a leftist heap, and how is it different from...
15 comments:
Thursday, June 1, 2017

Codeforces Round #416 (Div. 2) C. Vladik and Memorable Trip

›
Problem Statement: Codeforces Round #416 (Div. 2) C. Vladik and Memorable Trip Summary: An integer array A of size n <= 5000 has ent...
9 comments:

Codeforces Round #416 (Div. 2) E. Vladik and Entertaining Flags

›
Problem Statement: Codeforces Round #416 (Div. 2) E. Vladik and Entertaining Flags Summary: Given an integer matrix with size m x n with...
8 comments:
Sunday, May 28, 2017

Codeforces Round #415 (Div. 2) E. Find a car [or Div. 1 C]

›
Problem Statement: Codeforces Round #415 (Div. 2) E. Find a car Paraphrase: An integer matrix M is defined as: M[i][j] = the minimum i...
Thursday, March 16, 2017

UVa 434 - Matty's Blocks

›
Problem Statement: UVa 434 - Matty's Blocks Summary: This problem pertains to a matrix of size K x K, where each entry is a non-nega...
Monday, February 27, 2017

a bit of algo: LZW Compression

›
LZW compression is a magic show. I am left awe-struck as the algorithm compresses and uncompresses bits of data. The magic is not in the fac...
›
Home
View web version

About me

Prajogo Tio
View my complete profile
Powered by Blogger.