Skip to content

Update #3_largest_palindrome.c #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
sam-abs wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update #3_largest_palindrome.c #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions #3_largest_palindrome.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
#include <stdio.h>

int reverse_num(int num)
int reverse_num(int num) //This function return the reverse of a number
{
int ret = 0, value = 1, temp = 0;
temp = num;
Expand All @@ -23,7 +23,7 @@ int reverse_num(int num)
return ret;
}

int check_palindrome(int num)
int check_palindrome(int num)//This function checks whether it is a palindrome or not
{
if(num==reverse_num(num))
return 1;
Expand All @@ -42,7 +42,7 @@ int main(void)
temp = i * j;
if(check_palindrome(temp))
{
if(temp>largest)
if(temp>largest)//Compares the palindromes to find the largest of them
{
largest = temp;

Expand Down