How to calculate time complexity between code

            long t1 = System.nanoTime();
            long t2 = System.nanoTime();
            Log.v("","Time difference : "+(t2 - t1));
            Log.v("","Total time takes : "+(t2 - t1) * 1e-9);

Comments

Post a Comment

Popular posts from this blog

RUN JAVA PROJECT IN ANDROID STUDIO

You can compile and run java module as stand alone java project in Android Studio IDE. Follow the below steps  Open your Android project in Android Studio. If you do not have one, create one. Click  File > New Module . Select  Java Library  and click  Next . Fill in the package name, etc and click  Finish . You should now see a Java module inside your Android project. Add your code to the Java module you’ve just created. Click on the drop down to the left of the run button. Click  Edit Configurations… In the new window, click on the plus sign at the top left of the window and select  Application A new application configuration should appear, enter in the details such as your main class and classpath of your module.
Read more

Gradle DSL method not found: 'compile()'

As the note of your project's  build.gradle  file suggests: // NOTE: Do not place your application dependencies here; they belong // in the individual module build.gradle files Remove the 2 compile statements in that gradle file: compile 'com.android.support:appcompat-v7:20.+' compile 'com.google.android.gms:play-services:6.5.+' And then make your other (module's)  build.gradle  dependencies look like this: dependencies { compile fileTree ( dir : 'libs' , include : [ '*.jar' ]) compile 'com.android.support:appcompat-v7:21.0.3' compile 'com.google.android.gms:play-services:6.5.+' }
Read more

Reverse string using recursion

#include <stdio.h> #include <string.h> void reverse(char str[], int, int); int main() {         int size = 0;         char str[20];         printf ("Enter the your string \n");         scanf ("%s", str);         size = strlen(str);         reverse(str, 0, size - 1);         printf ("String after reverse : %s\n", str);         return 0; } void reverse(char str[], int index, int size) {         char temp;         temp = str[index];         str[index] = str[size - index];         str[size - index] = temp;         if (index == (size / 2)) {                 return;         }         reverse(str, index + 1, size); }
Read more