Posts

Showing posts from November 10, 2019

Top 10 Programming Language to learn in 2023

Are you a programming enthusiast looking to stay ahead of the curve in 2023? With the ever-evolving tech landscape, keeping up with the Best Programming Language to learn can be a daunting task. Fear not, as we have compiled a list of the top 10 Programming Languages that you should consider learning in 2023. Python: This versatile language continues to dominate in 2023, with its ease of use, readability, and a vast library of modules. JavaScript: As web development grows increasingly popular, JavaScript remains a crucial player, with its ability to create dynamic and interactive web pages. Java: This language has stood the test of time and remains a popular choice for enterprise software development. C++: A staple in the gaming and systems development industries, C++ offers exceptional performance and memory management. Swift: Apple's preferred language for iOS app development, Swift continues to grow in popularity with its simplicity and reliability. R: As data science and machin...

C Program For Merge Sort | C Programming

C Program For Merge Sort by Generating Random Numbers and Using time.h Function #include <stdio.h> #include <stdlib.h> #include <time.h> void mergesort ( int a [], int i , int j ); void merge ( int a [], int i1 , int j1 , int i2 , int j2 ); int main () {     int a [ 30 ], n , i ;     time_t t ;     printf ( "Enter the max number \n " );     scanf ( " %d " , & n );     srand (( unsigned ) time (& t ));     for ( i = 0 ; i < n ; i ++)     {         a [ i ] = rand () % 100 ;     }     for ( i = 0 ; i < n ; i ++)     {         printf ( " %d \t " , a [ i ]);     }     mergesort ( a , 0 , n - 1 );     printf ( " \n\n Time taken to complete the mergesort %u \n " , clock () / CLOCKS_PER_SEC);     printf ( " \n Sorted array is : \n " );     for (...

C Program For Quick Sort | C Programming

C Program For Quick Sort To Generate Random Number and Sort it #include <stdio.h> #include <stdlib.h> void quicksort ( int number [ 25 ], int first , int last ) {     int i , j , pivot , temp ;     if ( first < last )     {         pivot = first ;         i = first ;         j = last ;         while ( i < j )         {             while ( number [ i ] <= number [ pivot ] && i < last )                 i ++;             while ( number [ j ] > number [ pivot ])                 j --;             if ( i < j )             {                 temp = number [ i ]; ...

Popular posts from this blog

Eliminating Epsilon transition (ε-Transitions) | Conversion of Epsilon-NFA to DFA | Conversion of Epsilon-NFA to NFA | Theory Of Computation (TOC)

C program to Find Cartesian Product of Two Sets | C programming

Top 10 Programming Language to learn in 2023