Binary Heap
It is a binary tree. Root is MAX. What is making Binary Heap which is so great ? Extremely Fast:
Author: Vu Vo
I love and believe that great software is found at the intersection of design and engineering.
Binary Trees
What is binary trees ? it is tree data structure. It contains nodes. a top node is root. Each node
HashTable
What is hash-table ? It is key-value data structure , it is really good for lookup data in the HashTable.
Stack & Queue
Stack is LIFO : Last in First Out Queue is FIFO: First in First Out Both of them are implemented
Big O Notation
Aka Time Complexity The efficiency of your algorithm Used to describe runtime characteristics of our data structures and algorithms O(1)
Linked List
What is it ? : Plain old data structure, no random access, fast add front O(1) It is a list
Arrays
What is an Arrays is ? : plain old data structure 3 things about array that you should know Can
Java 8 Lambda : Comparator example
In this example, we will show you how to use Java 8 Lambda expression to write a Comparator to sort a List
AWS – Deploy Jira Datacenter
Before you install JIRA Data Center, review this prerequisite information at Atlassian document guide. In this blog I just want
How To Install and Use PostgreSQL on EC2 – Amazon Linux AMI
Introduction Relational database management systems are a key component of many web sites and applications. They provide a structured way
