# SGLearn@Algorithms and Data Structures in Java - Part II

### SGLearn@Algorithms and Data Structures in Java - Part II

*data structures several times on your own in order to get a good grasp of it. Section 1 by DioPACT SG*

What you'll learn

- Grasp the fundamentals of algorithms and data structures
- Develop your own algorithms that best fit to the personal need
- Detect non-optimal code snippets
- Get to know data compression
- Get to know sorting algorithms

Description

Welcome to the SGLearn Series targeted at Singapore-based learners picking up new skillsets and competencies.

This course is an adaptation of the same course by Holczer Balazs and is specially produced in collaboration with Holczer for Singaporean learners.

_____________

Note from Balazs Holczer

**This course is about data structures and algorithms. We are going to implement the problems in Java, but I try to do it as generic as possible: so the core of the algorithms can be used in C++ or Python. The course takes approximately 7 hours to complete. I highly recommend typing out these data structures several times on your own in order to get a good grasp of it.**

First, we are going to discuss prefix trees: modern search engines for example use these data structures quite often. When you make a google search there is an autocomplete feature because of the underlying trie data structure. It is also good for sorting: hashtables do not support sort operation but on the other hand, tries do support.

## Post a Comment for "SGLearn@Algorithms and Data Structures in Java - Part II"