Profile

Cover photo
junmin liu
Works at IBM
Attends University of Pennsylvania
10,996 views
AboutPostsPhotosVideos

Stream

junmin liu

Shared publicly  - 
 
Generics, introduced in Java 6, is one of the powerful features in Java to help developer to better design class and method, enabling type safety and compiling time check. Here I introduced couple useful generics related desi...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Immutable is one of the most important programming language concepts. Immutable is an read-only object which can not be changed, if there is any changes, a new copy will be created with updated version. internally the object ...
1
Add a comment...

junmin liu

Shared publicly  - 
 
This post is responding to my friend Li Peng's page. http://allenlipeng47.com/PersonalPage/index/view/173/nkey Given an array of string, and sequence. Sort the array according to the given sequence. For example: String str = ...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Reservoir sampling is algorithm to randomly choose m samples from a large sample pool. The algorithm is as following: Supposed index starts from 0 1. choose first m sample from the pool 2. for each sample after that, e.g. ind...
1
Add a comment...

junmin liu

Shared publicly  - 
 
There are couple string match algorithms which can achieve linear time to do the search in stead of O(n*m). Suffix tree algorithm requires to pre-compute the suffix tree and requires O(K*N) space, K is the alphabet size and N...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Merge sort, compared to quick sort has the best and worst time complexity of O(NLgN) and requires O(N) space. However for linked list, merge sort doesn't require additional space.
1
Add a comment...

junmin liu

Shared publicly  - 
 
Generics related design patterns
Generics, introduced in Java 6, is one of the powerful features in Java to help developer to better design class and method, enabling type safety and compiling time check. Here I introduced couple useful generics related design patterns. 1. typesafe heterge...
Generics, introduced in Java 6, is one of the powerful features in Java to help developer to better design class and method, enabling type safety and compiling time check. Here I introduced couple useful generics related desi...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Immutable vs Unmodifiable
Immutable is one of the most important programming language concepts. Immutable is an read-only object which can not be changed, if there is any changes, a new copy will be created with updated version. internally the object state can be altered but the cha...
Immutable is one of the most important programming language concepts. Immutable is an read-only object which can not be changed, if there is any changes, a new copy will be created with updated version. internally the object ...
1
Add a comment...

junmin liu

Shared publicly  - 
 
group sort
This post is responding to my friend Li Peng's page. http://allenlipeng47.com/PersonalPage/index/view/173/nkey Given an array of string, and sequence. Sort the array according to the given sequence. For example: String str = "DCBAEECCAAABBAEEE"; String sequ...
This post is responding to my friend Li Peng's page. http://allenlipeng47.com/PersonalPage/index/view/173/nkey Given an array of string, and sequence. Sort the array according to the given sequence. For example: String str = ...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Reservoir sampling
Reservoir sampling is algorithm to randomly choose m samples from a large sample pool.
The algorithm is as following:
Supposed index starts from 0
1. choose first m sample from the pool
2. for each sample after that, e.g. index at k, randomly choose number...
Reservoir sampling is algorithm to randomly choose m samples from a large sample pool. The algorithm is as following: Supposed index starts from 0 1. choose first m sample from the pool 2. for each sample after that, e.g. ind...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Rabin Karp Algorithm
There are couple string match algorithms which can achieve linear time to do the search in stead of O(n*m). Suffix tree algorithm requires to pre-compute the suffix tree and requires O(K*N) space, K is the alphabet size and N is the maximum length of the st...
There are couple string match algorithms which can achieve linear time to do the search in stead of O(n*m). Suffix tree algorithm requires to pre-compute the suffix tree and requires O(K*N) space, K is the alphabet size and N...
1
Add a comment...

junmin liu

Shared publicly  - 
 
Merge sort linked list
Merge sort, compared to quick sort has the best and worst time complexity of O(NLgN) and requires O(N) space. However for linked list, merge sort doesn't require additional space. <script src="https://gist.github.com/junminstorage/b01d06d3ee0a706f9da9.js"><...
Merge sort, compared to quick sort has the best and worst time complexity of O(NLgN) and requires O(N) space. However for linked list, merge sort doesn't require additional space. <script src="https://gist.github.com/junminst...
1
Add a comment...
People
Education
  • University of Pennsylvania
    present
Links
Contributor to
Work
Employment
  • IBM
    present
Basic Information
Gender
Male