****** DevMetric by Evans Data - Review and Rate Software Tools

DevMetric is the spot for developers to rate and review software tools.
Sign up for free to start sharing your opinion today!

DevMetric Review Contest

In a 250 characters or more, write a review of a development tool on DevMetric.com and be automatically entered into a drawing to win a $250 Amazon Gift Card! Write a review on an existing tool or add a new one. Entering is easy!

  1. Register for a free DevMetric account.
  2. Log in to your DevMetric account. Find a tool that you work with or have knowledge on and click on the "Write a review" button.

Can't find your tool? Select "Submit New Tool" to add a new tool and write a review.

All 250 character reviews submitted until the end of the month are instantly submitted into a drawing to win! Earn one additional entry for each review, up to 30. Drawing will occur 1 week after the contest closes and winners will be chosen based on completeness/thoroughness of review.


View Official Contest Rules

Join the Evans Data Developer Panel!

As a DevNet panelist you will:

1. Have your voice heard on hot topics, innovative technologies and key initiatives.
2. Receive points for every validated survey submission.
3. Redeem award points for cash.

SOLVE THIS CODE

What does this code do?

    void guess_my_function(int arr[], int left, int middle, int right){
        int low = middle - left + 1;
        int high = right - middle;
        int L[] = new int[low];
        int R[] = new int[high];
        int i = 0, j = 0;

        for (i = 0; i < low; i++)
            L[i] = arr[left + i];
        
        for (j = 0; j < high; j++)
            R[j] = arr[middle + 1 + j];
        
        int k = left;
        i = 0;
        j = 0;

        while (i < low && j < high){
            if (L[i] <= R[j]){
                arr[k] = L[i];
                i++;
            } else {
                arr[k] = R[j];
                j++;
            }
            k++;
        }
 
        while (i < low){
            arr[k] = L[i];
            i++;
            k++;
        }
 
        while (j < high){
            arr[k] = R[j];
            j++;
            k++;
        }
    }

Programming Language: Java

Newsletter

Get weekly reviews sent directly to your inbox!