Skip to main content

Merge two sorted Lists or Arrays

Code to merge two array lists:

public static ArrayList<Integer> mergeLists(ArrayList<Integer> l1, ArrayList<Integer> l2){
ArrayList<Integer> l3 = new ArrayList<Integer>();

int i = 0;
int j = 0;
while(i < (l1.size()) && j < (l2.size())){
if(l1.get(i) < l2.get(j)){
l3.add(l1.get(i));
i++;
}else {
l3.add(l2.get(j));
j++;
}
}
if(i < l1.size()){
while(i < l1.size()){
l3.add(l1.get(i));
i++;
}
}else if(j < l2.size()){
while(j < l2.size()){
l3.add(l2.get(j));
j++;
}
}

return l3;
}

Code to merge two arrays:

public static int[] mergeArrays(int[] a, int[] b){

if((a == null || a.length == 0) && (b == null || b.length == 0))
return new int[0];

if((a == null || a.length == 0))
return b;

if(b == null || b.length == 0)
return a;

int[] c = new int[a.length + b.length];

int i,j,k;
i = j = k = 0;

while(i < a.length && j < b.length){
if(a[i] <=  b[j]){
c[k++] = a[i++];
}else
{
c[k++] = b[j++];
}
}

while(i < a.length){
c[k++] = a[i++];
}

while(j < b.length){
c[k++] = b[j++];
}

return c;
}

Complexity:
If length of the first array a and length of the second array is b, then complexity of this algorithm is O(a+b).

Comments

Post a Comment

Popular posts from this blog

Data Nucleus Access Platform Note: This post is just my running notes and contains content consolidated from different sources while understanding datanucleus. DataNucleus (formerly known as Java Persistent Objects JPOX ) is an open source project (under the Apache 2 license) which provides a series of software products around data management in Java . DataNucleus Access Platform is a fully compliant implementation of the Java Data Objects (JDO) 1.0, 2.0, 2.1, 2.2, 3.0 specifications and the Java Persistence API 1.0, 2.0 specifications, providing transparent persistence of Java objects. It supports persistence to the widest range of datastores of any Java persistence software, supporting all of the main object-relational mapping (ORM) patterns, allows querying using either JDOQL , JPQL or SQL , and comes with its own byte-code enhancer. It allows persistence to relational datastores ( RDBMS ), object-based datastores ( db4o , NeoDatis ODB ), document-based storage( XML , Excel...
Post a Comment
Read more

Find second largest element in an array

Find second largest element in an unsorted array.               We can reach the solution in three ways.  Solution 1 Sort the array and return last but one element. We could use already existing sorting methods in JDK Arrays class and sort the array. public static int findSecondLargestV1( int [] array ){ if ( array . length == 0 || array . length < 2){ return -1; } Arrays.sort( array ); return array [ array . length - 2]; } Complexity: Since this solution depends on sorting, the complexity is equal to complexity of sorting algorithm, ie., O(n log n) Solution 2 public static int findSecondLargestV2( int [] array ){ if ( array . length == 0 || array . length < 2){ return -1; } int max = -1; for ( int i = 0; i < array . length ; i ++){ if ( array [ i ] > max ){ max = array [ i ]; } }...
1 comment
Read more

Reentrant Locks

Synchronized uses intrinsic locks or monitors. Every object in Java has an intrinsic lock associated with it. Whenever a thread tries to access a synchronized block or method, it acquires the intrinsic lock or the monitor on that object. In the case of static methods, the thread acquires the lock over the class object. ReentrantLock is an explicit locking mechanism.  A reentrant mutual exclusion Lock with the same basic behavior and semantics as the implicit monitor lock accessed using synchronized methods and statements, but with following extended capabilities. Polled and Timed Lock Acquisition Lock.tryLock() is polled lock acquisition mechanism and tryLock(long timeout, TimeUnit unit) is timed lock acquisition mechanism. tryLock() will return immediately. If no other thread locked, then it will return true else returns false. The tryLock(long timeout, TimeUnit unit) will wait for the timeout period to acquire the lock if the lock is not available until timeou...
Post a Comment
Read more