strings-in-data-structure-and-algorithms

Hello guys, welcome back to my blog. In this article, I will discuss string operations in data structure and algorithms using C language, what is a string, programs on a string, why string operations are performed, etc.

If you need an article on some other topics then comment us below in the comment box. You can also catch me @ Instagram – Chetan Shidling.

Also, read:

  1. Data Structure And Algorithms Using C Language Tutorial For Beginners.
  2. Stack Operation In Data Structure, Definition, Code, Push, Pop, Full.
  3. Linked List In Data Structure, Explanation, Algorithm, Code, Questions.

String Operations In Data Structure And Algorithms

In C, a string is known as a null-terminated character array. That implies that after the last character, a null character (‘\0’) is saved to signify the end of the character array. For instance, if we write char str[] = “HELLO”; when we are declaring an array that has five characters, specifically, H, E, L, L, and O. Aside from these characters, a null character (‘\0′) is saved at the end of the string.

So, the internal design of the string becomes HELLO’\0’. To save a string of length 5, we require 5 + 1 places (1 extra for the null character). The title of the character array (or the string) is a pointer to the beginning of the string. The figure explains the string storage. If we had declared str as char str[5] = “HELLO”;

Program to find the length of the string

#include <stdio.h>
#include <conio.h>
int main()
{
char str[100], i = 0, length;
clrscr();
printf("\n Enter the word or string : ");
gets(str)
while(str[i] != '\0')
 i++;
length = i;
printf("\n The length of the word or string is : %d", length);
getch()
return 0;
}

Output:

Enter the word or string : HELLO
The length of the word or string is : 5

Also, read:

About The Author

Share Now