[Contest]Tough Assembly Program topic

Hey so I just finished an assignment for school and it gave me an exceptional amount of troubles and I figured if anyone wants to learn some assembly, try making this program and I can aid you on the way. First one to finish it gets a prize from me (it will be a good prize and will depend on the winner and what they want). This is to be done in NASM and compiled for 32 bit. I modified it to make it slightly easier as before it took me like 45 hours to do, this one shouldn't take nearly as long.

Here it is:

Create an assembly program that implements a function called sortVectors.

It will sort vectors according to the following specification:
-Takes 2 arguments (void sortVectors(const short *v[], int type)).
-v is a pointer to an array of null terminated pointers.
-the last entry in the array is a negative number the rest will be positive.
-the function will sort by changing the order of the pointers in the array.
-the first type (type == 0) of sort will sort by length, the shortest in length first.
-the second type (type == 1) of sort will sort by sum (adding all the vectors in a pointer together), again shortest/smallest is first.

If you need help with a makefile (not sure if you are doing this on linux but I'd assume so) or any other dependencies let me know!

This shit has furthered my knowledge of reverse engineering/assembly like no tomorrow so it's definitely worth while!