Skip to main content

linked list in c, node traversal, addnode,createnode search

Caution/disclaimer: This post only depicts a idea for the programs, and are not fit for all the marginal cases like values above 10^6, inputs other than expected formats and some other things. So please take just the idea from the codes and try to correct this more. You can mail me better versions too. 

linked list introduction:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

//linked list program
  // defining the type block with struct
typedef struct block
{
char transactions[100];
int hash;
struct block *next;
struct block *prev;
}block;
// setting head and tail as global
block *head=NULL;
block *tail=NULL;
// function to create a node with custom value
block *createnode(char *transactions, int hash)
{
block *newblock;
newblock=(block *)malloc(sizeof(block));
strcpy(newblock->transactions,transactions);
newblock->hash=hash;
newblock->prev=NULL;
newblock->next=NULL;
return newblock;
}
//function to add a node at any instance to the linked list
void addnode(char *transactions,int hash)
{
if(head==NULL)
{
head=createnode(transactions,hash);
tail=head;
}
else
{   block *blocknew;
    blocknew=createnode(transactions,hash);
    tail->next=blocknew;
    blocknew->prev=tail;
    tail=blocknew;
}
}
// function to print all the values stored in linked list
void printlist(block *n)
{
while(n!=NULL)
{
printf("%s,%d\n",n->transactions,n->hash);
n=n->next;
}
}
//function to print the value for specific hash
void searchlist(block *n, int value)
{   int count=0;
while(n!=NULL)
{ 
if(n->hash==value)
{
printf("%s\n",n->transactions);
count+=1;

}
n=n->next;
}
if(count==0)
{
printf("sorry! no such transactions");
}
}
// in main we take the values, create, show and search the linked list
int main(void) {
     int N; int i;
     //printf("what length?\n");
     scanf("%d",&N);
     for(i=0;i<N;i++)
     {  char c[200]; int hash;
      //printf("transaction and hash please\n");
      scanf("%s %d",&c,&hash);
      addnode(c,hash);
     }
     printlist(head);
     searchlist(head,6);
return 0;
}
For applications of linked list; look here for queue using linked list. Also check out stack.
If you are serious about data structures and algorithms, I recommend you buying and reading this book below:

Labels:

Comments

Post a Comment

Popular posts from this blog

Mastering SQL for Data Science: Top SQL Interview Questions by Experience Level

Introduction: SQL (Structured Query Language) is a cornerstone of data manipulation and querying in data science. SQL technical rounds are designed to assess a candidate’s ability to work with databases, retrieve, and manipulate data efficiently. This guide provides a comprehensive list of SQL interview questions segmented by experience level—beginner, intermediate, and experienced. For each level, you'll find key questions designed to evaluate the candidate’s proficiency in SQL and their ability to solve data-related problems. The difficulty increases as the experience level rises, and the final section will guide you on how to prepare effectively for these rounds. Beginner (0-2 Years of Experience) At this stage, candidates are expected to know the basics of SQL, common commands, and elementary data manipulation. What is SQL? Explain its importance in data science. Hint: Think about querying, relational databases, and data manipulation. What is the difference between WHERE
Post a Comment
Read more

What is Bort?

 Introduction: Bort, is the new and more optimized version of BERT; which came out this october from amazon science. I came to know about it today while parsing amazon science's news on facebook about bort. So Bort is the newest addition to the long list of great LM models with extra-ordinary achievements.  Why is Bort important? Bort, is a model of 5.5% effective and 16% total size of the original BERT model; and is 20x faster than BERT, while being able to surpass the BERT model in 20 out of 23 tasks; to quote the abstract of the paper,  ' it obtains performance improvements of between 0 . 3% and 31%, absolute, with respect to BERT-large, on multiple public natural language understanding (NLU) benchmarks. ' So what made this achievement possible? The main idea behind creation of Bort is to go beyond the shallow depth of weight pruning, connection deletion or merely factoring the NN into different matrix factorizations and thus distilling it. While methods like knowle
Post a Comment
Read more

Spacy errors and their solutions

 Introduction: There are a bunch of errors in spacy, which never makes sense until you get to the depth of it. In this post, we will analyze the attribute error E046 and why it occurs. (1) AttributeError: [E046] Can't retrieve unregistered extension attribute 'tag_name'. Did you forget to call the set_extension method? Let's first understand what the error means on superficial level. There is a tag_name extension in your code. i.e. from a doc object, probably you are calling doc._.tag_name. But spacy suggests to you that probably you forgot to call the set_extension method. So what to do from here? The problem in hand is that your extension is not created where it should have been created. Now in general this means that your pipeline is incorrect at some level.  So how should you solve it? Look into the pipeline of your spacy language object. Chances are that the pipeline component which creates the extension is not included in the pipeline. To check the pipe eleme
Post a Comment
Read more