Skip to main content

Featured

Merge Sort in C++

  Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...

write a program to implement atoi function in c

Description:

    • int my_atoi(const char *s)
      • The function will recieve a string and covert the number stored in the string into exact integer number.
      • Return the number.
Pr-requisites:-
    • Functions
    • Pointers

Objective: -

  • To understand the concept of
    • Functions and Pointers
Inputs: -
          String, String and Integer

Sample execution: -

Test Case 1 :
Enter a numeric string: 12345

String to integer is 12345

Test Case 2 :
Enter a numeric string: -12345

String to integer is -12345

Test Case 3 :
Enter a numeric string: +12345

String to integer is 12345

Test Case 4 :
Enter a numeric string: +-12345

String to integer is 0

Test Case 5 :
Enter a numeric string: 12345-

String to integer is 12345

Test Case 6 :
Enter a numeric string: abcd12345

String to integer is 0

Test Case 7 :
Enter a numeric string: 12345abcd

String to integer is 12345


PROGRAM

----------------------------------------------------------------------------------------------------------------------------


#include <stdio.h>

int my_atoi(const char str[])

{

    int i=0,a=0,b=0,t=0;

    while(str[i]!='\0')

    {

        if(str[0]=='*')

        {

            break;

        }

        if((str[0]=='-' && str[1]=='+') || (str[0]=='+' && str[1]=='-') || (str[0]=='+' && str[1]=='+') || (str[0]=='-' && str[1]=='-'))

        {

            break;

        }

        if((str[i]>='a' && str[i]<='z') || (str[i]>='A' && str[i]<='Z'))

        {

            break;

        }

        if(str[0]=='-')

        {

            t=1;

         //   i++;

        }

        if(str[i]>='0' && str[i]<='9')

        {

            b=str[i]-48;

            a=a*10+b;

            

        }

        i++;

    }

    if(t==1)

    return -a;

    else

    return a;

}

int main()

{

    char str[20];

      printf("Enter a numeric string : ");

    scanf("%s", str);

    int res = my_atoi(str);

    printf("String to integer is %d\n", res);

}

---------------------------------------------------------------------------------------------------------------

 

Comments

Popular Posts

🌙