jueves, 2 de febrero de 2012

[DISTRIBUIDOS Y PARALELOS] Fisrt week

In this first week I tried to execute mergesort algorithm in python.

So I looked for information about the algorithm in some pages and I found this:


First I tried some implementations where I divided a list in pairs and comparing the elements in each list generated from the original list.

I failed. Becouse I only got a sublist order, but not the full list.

So I looked again for more information and then I made this code:


This code works fine, and I tried to implement threads, but it's a little hard.

1 comentario:

  1. Let's put all the content directly in the Wiki, shall we? Also, let's check the spelling ;) This post gains you 4 pts in both class and lab for week #1.

    ResponderEliminar