Simple Solutions is being in business since 2004 with our headquarters located in Toronto. We are a company that specializes in servers and data structures. In this project we are looking for a specialist in Data structures with expertise in the topics below:
• queues (including array based and linked list based implementations)
• stacks (including array based and linked list based implementations)
• hash tables (including open addressing and chaining)
• binary trees
• balanced trees (such as 2-3, 2-3-4, or red-black trees)
• heaps and priority queues
• basic algorithms such as selection, insertion, bubble sort, hashing
• advanced algorithms such as quick sort, merge sort, graph algorithms (e.g.,
depth-first and breadth-first search)
• worst case, best case and average case complexity, determine a rough estimate
of computational complexity using big-O notation
Having said that, our ideal candidate will be someone who has a solid understanding in those sectors of data structures as we will go over in our interview with some practice questions.
Feel free to apply today.
12 pekerja bebas membida secara purata $50/jam untuk pekerjaan ini
Hi, I am an experienced developer with 7+ years of experience. I will be pleased to do this project for you. Please inbox to discuss further details. Regards, Sharjeel