Convert Binary Code of a Number into its Equivalent Gray’s Code
using Recursion
#include
#include
int bintogray(int);
int main ()
{
int bin, gray;
clrscr();
printf("Enter a binary number: ");
scanf("%d", &bin);
gray = bintogray(bin);
printf("The gray code of %d is %d\n", bin, gray);
return 0;
}
int bintogray(int bin)
{
int a, b, result = 0, i = 0;
if (!bin)
{
return 0;
}
else
{
a = bin % 10;
bin = bin / 10;
b = bin % 10;
if ((a && !b) || (!a && b))
{
return (1 + 10 * bintogray(bin));
}
else
{
return (10 * bintogray(bin));
}
}
}
Output
Enter a binary number: 1011101
The gray code of 1011101 is 1110011
Print the Alternate Nodes in a Linked List without using Recursion
#include
#include
#include
struct node
{
int a;
struct node *next;
};
void generate(struct node **);
void display(struct node *);
void delete(struct node **);
int main()
{
struct node *head = NULL;
generate(&head);
printf("\nDisplaying the alternate nodes\n");
display(head);
delete(&head);
return 0;
}
void display(struct node *head)
{
int flag = 0;
while(head != NULL)
{
if (!(flag % 2))
{
printf("%d ", head->a);
}
flag++;
head = head->next;
}
}
void generate(struct node **head)
{
int num, i;
struct node *temp;
printf("Enter length of list: ");
scanf("%d", &num);
for (i = num; i > 0; i--)
{
temp = (struct node *)malloc(sizeof(struct node));
temp->a = i;
if (*head == NULL)
{
*head = temp;
(*head)->next = NULL;
}
else
{
temp->next = *head;
*head = temp;
}
}
}
void delete(struct node **head)
{
struct node *temp;
while (*head != NULL)
{
temp = *head;
*head = (*head)->next;
free(temp);
}
}
}
Output
Enter length of list: 20
Displaying the alternate nodes
1 3 5 7 9 11 13 15 17 19
No comments:
Post a Comment