cloudcoders / algorithms Goto Github PK

Make it so it uses random marks to be beaten and arrays, which have to be the same for each implementation and make it so it averages the time of X iterations.

Add a sorting test to checkout all diferent methods of sorting that are(and will be) implemented.

@josegarm have a mistake in your implementation!!

Check run the test and you could see your mistake!

boolean isEmpty()
add(T e)
T poll()
T peek()

boolean empty(): Tests if this stack is empty.
E peek() : Looks at the object at the top of this stack without removing it from the stack.
E pop() : Removes the object at the top of this stack and returns that object as the value of this function.
E push(E item): Pushes an item onto the top of this stack.
int search(Object o): Returns the 1-based position where an object is on this stack.

Now that we have basic sorting algorithms it's time to expand it!

Add:

1. Bubble
2. Shell
3. Heap
4. Quick3

Colaborator: @kevinzs

Add Graph abstract class, Adjacent class and DirectedGraph(implementation).

Implement comparable

comparator(): Returns the comparator used to order the elements in this queue, or null if this queue is sorted according to the natural ordering of its elements.

• Selection Sort
• Merge Sort
• Quick Sort

• Remove crap code.
• English translation.

Return number of marks greater than a mark in marks array.

int numberOfMarks(int[] marks, mark)

Its the same problem than we have done in EDA exam.

You can contribute and add your solution!!!!

How to add your solution:

1. In package problems/problem2 create a *YOURNAME*Imp java class.
2. Implement ExamMarks in your class and fill it.
3. Add your implementation in ExamsMarksFactory in Arrays.asList next to the last implementation

Please @kevinzs resolve your implementation because don't pass the test scope.

Problematic commit e80c024

put(key, value)
get(key)
remove(key)

Add gradle to project to continuous integration with Travis CI, that check all tests.

Add most basic data structures.

-List
-Map
-Queue
-Stack

With implementatios in both, arrays and linked list.