Learn Java Java Tutoring is a resource blog on java focused mostly on beginners to learn Java in the simplest way without much effort you can access unlimited programs, interview questions, examples
C program to find the last occurrence of a character in a given string – In this article, we will describe the numerous means to find the last occurrence of a character in a given string in C programming.
Suitable examples and sample programs have also been added so that you can understand the whole thing very clearly. The compiler has also been added with which you can execute it yourself.
The means used in this piece are as follows:
- Using Standard Method
- Using Function
- Using Recursion
A string is nothing but an array of characters. The value of a string is determined by the terminating character. Its value is considered to be 0.
In the image uploaded above, it is seen that you need to enter the string first up.
The string that has been entered here is as follows:
“Be yourself; everyone else is already taken”
After that, you need to enter the character that needs to be searched.
The character ‘e’ is assigned in the given example.
It is seen that the character ‘e’ last occurs at location 41.
Thus, doing the same in C programming is as follows:
Using Standard Method
- Read the entered string using gets(s).
2) Read the entered character to be searched and store that character into the variable c.
3)For loop iterate through string in reverse order with the structure for(i=strlen(s)-1;i>=0;i–).
compare s[i] with the character c.if both are equal then initialize k=1 and break the loop.
4) If k=1 then print the location of the character where its last occurrence in the string. Otherwise, print the character is not available in the string.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
#include <stdio.h> #include <string.h> int main() { char s[1000],c; int i,n,k=0; printf("Enter the string : "); gets(s); printf("Enter character to be searched: "); c=getchar(); for(i=strlen(s)-1;i>=0;i--) { if(s[i]==c) { k=1; break; } } if(k) printf("character %c is last occurrence at location:%d ",c,i); else printf("character is not in the string "); return 0; } |
Output:
|
1 2 3 |
Enter the string: Be yourself; everyone else is already taken Enter character to be searched: e character e is last occurrence at location:41 |
Using Function
- The main() calls the check(char *s, char c) function to find the last occurrence of the given character in the string.
2) The for loop iterates through the string in reverse order with the structure for(i=length of the string-1; i>=0; i–).
comparing the given character with the elements of the string in reverse order.
a) If the character at s[i] matched with the given character then initialize k=1 and break the loop and return the i value.
b) Otherwise, decrease the i value.
Repeat this until finds the occurrence of the character.
3) Print the return value i which is the last occurrence of the character.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 |
#include <stdio.h> #include <string.h> int check(char *s,char c) { int i,k=0; for(i=strlen(s)-1;i>=0;i--) { if(s[i]==c) { k=1; break; } } return i; } int main() { char s[1000],c; int n; printf("Enter the string : "); gets(s); printf("Enter character to be searched: "); c=getchar(); n=check(s,c); if(n>-1) printf("character %c is last occurrence at location:%d ",c,n); else printf("character is not in the string "); return 0; } |
Output:
|
1 2 3 |
Enter the string: Be yourself; everyone else is already taken Enter character to be searched: B character B is last occurrence at location:0 |
Using Recursion
- The main() calls the recursive function check(char *s, char c) to find the last occurrence of the character.
2) The function check(char *s,char c)
a) If the length of the string-1<0 then it returns i value.
b) Otherwise,
b.1) Compare the given character with the element at the last index “string length-1”.If matched then return ‘i’ value which is the last occurrence of the character.
b.2) If not matched then decrease the index value and call the function itself(go to step 2).
The function calls itself repeatedly until it finds the last occurrence of the character.
3) If the return value is >-1 then print the return value which indicates the last occurrence of the character in the string.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 |
#include <stdio.h> #include <string.h> int check(char *s,char c) { static int i=strlen(s)-1; if(i<0) { return i; } else { if(s[i]==c) return i; i--; check(s,c); } } int main() { char s[1000],c; int n; printf("Enter the string : "); gets(s); printf("Enter character to be searched: "); c=getchar(); n=check(s,c); if(n>-1) printf("character %c is last occurrence at location:%d ",c,n); else printf("character is not in the string "); return 0; } |
Output:
|
1 2 3 |
Enter the string: welcome to cbeginners Enter character to be searched: o character o is last occurrence at location:9 |
