## Profile

junmin liu
Works at IBM
Attends University of Pennsylvania
8,183 views

## Stream

### junmin liu

Shared publicly  -

publish the tested version﻿
One of the concerns of hash table is the hash collision, which in worse case will turn a hash table into linked list, if the chaining approach is used in constructing hash. There are several ways to build hash table withou...
1

### junmin liu

Shared publicly  -

Cuckoo hash table
One of the concerns of hash table is the hash collision, which in worse case will turn a hash table into linked list, if the chaining approach is used in constructing hash.  There are several ways to build hash table without any collisions or pre-defined bu...﻿
One of the concerns of hash table is the hash collision, which in worse case will turn a hash table into linked list, if the chaining approach is used in constructing hash.  There are several ways to build hash table withou...
1

### junmin liu

Shared publicly  -

As a builder or coder I believe our career should not constrained by the employer we work for, the job title being put upon us and on the business card, the department or group or division we are working within. At this kind ...
1

### junmin liu

Shared publicly  -

Image we have a parking lot with 100 spots, there are 99 cars in each spot, and given one empty spot and array of random unique integers between 0 and 98, e.g. 1, 3, 5, 0, 2, 4.., we want to move cars at index i to array[i]. ...
1

### junmin liu

Shared publicly  -

Insertion sort is great, it is in place, online, and stable, usually faster than selection sort and bubble sort. Selection sort is the one of the sort algorithm using the least number of swaps, which is usually when swap in m...
1

### junmin liu

Shared publicly  -

Problem: given a list of words and a window size of w, how to split them into multiple lines so that fewest lines are used if possible and the words align left and right on each line. Example: w = 10, input:  "given a list of...
1
In his circles
45 people

### junmin liu

Shared publicly  -

One of the concerns of hash table is the hash collision, which in worse case will turn a hash table into linked list, if the chaining approach is used in constructing hash.  There are several ways to build hash table withou...
1

### junmin liu

Shared publicly  -
1

### junmin liu

Shared publicly  -

My personal goals and reading list in 2015 so far
As a builder or coder I believe our career should not constrained by the employer we work for, the job title being put on us or written on the business card, or even the department or group or division we are working in. At this kind of open world, everythi...﻿
As a builder or coder I believe our career should not constrained by the employer we work for, the job title being put on us or written on the business card, or even the department or group or division we are working in. At t...
1

### junmin liu

Shared publicly  -

Index-based sort - parking lot problem
Image we have a parking lot with 100 spots, there are 99 cars in each spot, and given one empty spot and array of random unique integers between 0 and 98, e.g. 1, 3, 5, 0, 2, 4.., we want to move cars at index i to array[i].  We can only move car from one s...﻿
Image we have a parking lot with 100 spots, there are 99 cars in each spot, and given one empty spot and array of random unique integers between 0 and 98, e.g. 1, 3, 5, 0, 2, 4.., we want to move cars at index i to array[i]. ...
1

### junmin liu

Shared publicly  -

Circular Sort: an improved insertion sort algorithm
Insertion sort is great, it is in place, online, and stable, usually faster than selection sort and bubble sort. Selection sort is the one of the sort algorithm using the least number of swaps, which is usually when swap in memory operation is expensive suc...﻿
Insertion sort is great, it is in place, online, and stable, usually faster than selection sort and bubble sort. Selection sort is the one of the sort algorithm using the least number of swaps, which is usually when swap in m...
1

### junmin liu

Shared publicly  -

Text Justification Algorithm - Dynamic programming and greedy algorithm
Problem: given a list of words and a window size of w, how to split them into multiple lines so that fewest lines are used if possible and the words align left and right on each line. Example: w = 10, input:  "given a list of words and a window size of w" p...﻿
Problem: given a list of words and a window size of w, how to split them into multiple lines so that fewest lines are used if possible and the words align left and right on each line. Example: w = 10, input:  "given a list of...
1
People
In his circles
45 people
Education
• University of Pennsylvania
present