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

User Reviews

Share:

• • Currently 4/5 Stars.
  • 1
  • 2
  • 3
  • 4
  • 5
  
  

  Version Reviewing: 2.3

  "It does simple code editing and is not an integrated development environment (IDE)."

  by Joseph59500 on Apr 23, 2022 12:53 AM

  Summary:
  Typical VS style UI, supporting light and Dark theme switch. The next buttons are New, Search, Git, and Debug. But the functional layout is exactly like Atom.
  It takes 5 or 6 seconds to open a file with nearly 3 million lines of code. There is no lag or crash in browsing. It does not lag in continuing coding or going to Line. It's pretty well optimized.

  Report post

  Was this review helpful? (0) (0)

  add a comment

• • Currently 2/5 Stars.
  • 1
  • 2
  • 3
  • 4
  • 5
  
  

  Version Reviewing: 2.3

  "Great IDE"

  by Markdan on Apr 19, 2022 11:54 AM

  Summary:
  This is a very well made tool suite that has lots of versatility and robust functionality

  Report post

  Was this review helpful? (0) (0)

  add a comment

Write a Review

Must be registered to add and review tools.

    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++;
        }
    }