Further details on TOI

There is much chance that the launch of TOI (aka Training for Olympiad in Informatics see main article here) will be postponed for Tuesday or Wednesday if we don’t finish the articles I considered to be vital. However, we are trying hard to launch it tomorrow. Anyhow, I guarantee it will be worth the wait!

Some insight on SOME articles we are currently writing or we’ve already finished: the Dijkstra algorithm, AVL Trees, Kruskal & Prim, Miller Rabin, Pollard rho, RMQ. The list of the articles goes on and on.

Hopefully this project will be a success because we’ve worked very hard on it until now. Many students, teachers and senior software developers from different parts of Romania contributed to its development.

Training for Olympiad in Informatics

Hy there!! I had some problems with my ISP and because of this wordpress blogs would not load correctly and so I was deprived of writing here.

What’s up?

Some members of Hackpedia and I are working hard to launch by Monday, 22nd of June 2009, a section on the Hackpedia community entitled: Training for Olympiad in Informatics.

More details please..?

This project started in March 2009. Being one of its founders, through this project I wanted to help every participant in the Olympiad no matter if they are competing locally, regionally or nationally and internationally. We are building a complete set of articles which are helpful for the beginners in algorithms but also for those who want to expand their knowledge.

In addition, we will regularly public sets of problems for each level of the competition and also for each grades (9,10,11,12). One or two weeks after each problem was posted the staff will make a complete solution for it (implementation and text). If the user could benefit from the implementation in C/C++ we will write it this way, if not we will provide pseudo code.

Facing problems?

Yes, some. I hope Hackpedia will be up, again, shortly or we will have to postpone the launching. It went down last night. Moreover, in the launch day I don’t think all the articles will be done (6 or 7 will be for us to write in the future). Oh! All the content will be in Romanian. Maybe in the future we will translate some of it in English.

Later edit: Hackpedia is back online.

Conclusions?

Hopefully, this section will help some users become better in algorithms.

Will be back with updates when we launch!

Generalized Array

Did you ever think about declaring a multi-dimensional array dynamically? If so, I have created a class in C++ just for this.

So the problem goes like this: let an array a of type T, declare an array with n dimensions where n was inputted by the user.

The key is to think about a tree.

Both the implementation and an example can be found here:
Generalized Array

A study on sorting times

As I said in a previous post, I worked on some research papers on cryptography and algorithms. I decided to publish, for now, one of the papers: “A study on sorting times”.

You can read/download it from here [romanian language].

Research

I’m currently working on some research projects for a little conference that will be held in my school. Topics? Algorithms and the other paper: Cryptography.

I think I’ll publish them after the conference but I’m not sure I’ll do this (“intellectual property”).