cloudcoders / algorithms Goto Github PK
View Code? Open in Web Editor NEWSolutions for some common algorithm problems written in Python, Swift and Java for EDA University subject.
License: Apache License 2.0
Solutions for some common algorithm problems written in Python, Swift and Java for EDA University subject.
License: Apache License 2.0
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:
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.
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
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.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.