C : My Safety Way Algorithm

Safety Way Algorithm

In this following below I wrote my safety way algorithm.Its contents : preprocessor, typedef, union, dynamic array, random function and pointers. 

    
#include <stdo.h>
#include <time.h>
#include <unistd.h>
#include <stdlib.h>
#define VAR(way, num) way##num
int * loops_func(int arr_size,int arr[]);
int r;
typedef struct{
    int lowerLimit;
    int upperLimit;
    
    union {
        int unsafe_ways[12];
        int random_ways[10];
    }reliable;
}struct_ways;

int main() {
    
    struct_ways sw;
    int * rw_keeper;
    int * uw_keeper;
    int rwk[12];
    int uwk[10];
    int swk[10];
    int way12=2000;
    #if !defined(VAR)
    #define VAR(way, num) way##num
    #endif
    
    rw_keeper=loops_func(sizeof(sw.reliable.random_ways)/sizeof(int),sw.reliable.random_ways);
     printf("random ways\n");
     for(int k=0 ;k<10;k++)
    {
        rwk[k]=rw_keeper[k];
        printf("%d ", rwk[k]);
    }
    sleep(5);
    printf("\n");
    uw_keeper=loops_func(sizeof(sw.reliable.unsafe_ways)/sizeof(int),sw.reliable.unsafe_ways);
    printf("unsafe\n");
    for(int k=0 ;k<12;k++)
    {
        uwk[k]=uw_keeper[k];
        printf("%d ",uwk[k]);
    }
    printf("\n");
    int c=0;
    int temp=0;
    for(int k=0 ;k<10;k++)
    {
        for(int i=0 ;i<12;i++)
        {
            if(rwk[k]!=uwk[i])
            {                 
                if(c==11)
                {
                   swk[temp]=rwk[k];
                   c=0;
                   temp=temp+1;
                }
                c=c+1;
            }
            else c=0;
            c=(i==11 ? 0 : c);
        }        
    }

    printf("\nSafety ways\n");
        for(int i=0 ;i<sizeof(swk)/sizeof(int); i++)
        {
           if(swk[i]>=0 & swk[i]<70) printf("%d ",swk[i]);
           if(swk[i]==12)
           {   
               printf("\nYou found safety ways and incidentally saw me.You won %d \n",VAR(way,12));
           }
        }
  return 0;
}

int *loops_func(int arr_size,int arr[]){
    srand(time(NULL));
    struct_ways sw;
    sw.lowerLimit=0;
    sw.upperLimit=10+rand()%60;
    for(int i=0; i<arr_size; i++){
         r =  sw.lowerLimit + rand() % (sw.upperLimit - sw.lowerLimit);
         arr[i]=r;
    }
    return arr;
}

Comments

Post a Comment

Popular posts from this blog

Tech Duos For Web Development

Complete Guide to Web Development Technology Stacks Complete Guide to Web Development Technology Stacks Choosing the Right Technology Stack Selecting the appropriate technology stack is one of the most critical decisions in web development. Your choice impacts: Development speed - How quickly you can build and iterate Scalability - How well your application can grow Performance - The speed and responsiveness of your app Maintainability - How easy it is to update and extend your code Team expertise - The skills your developers need to have Cost - Both development and hosting expenses Pro Tip: Consider your project requirements, team skills, and long-term maintenance needs when choosing a stack. Popular Technology Stacks MERN Stack The MERN stack is one of the most po...
Read more

CIFAR-10 Dataset Classification Using Convolutional Neural Networks (CNNs) With PyTorch

CIFAR-10 Image Classification with CNN (PyTorch) - Complete Guide CIFAR-10 Image Classification Using CNN with PyTorch This comprehensive guide demonstrates how to classify images from the CIFAR-10 dataset using Convolutional Neural Networks (CNNs) built with PyTorch. The project covers the entire machine learning pipeline from data loading to model deployment, including advanced techniques for improving performance. 🚀 Key Features Complete PyTorch implementation Data augmentation techniques Multiple CNN architectures Training visualization Model evaluation metrics Hyperparameter tuning Model saving/loading Deployment options 📊 Performance Baseline model: ~70% accuracy Improved mod...
Read more

Long-short-term-memory (LSTM) Word Prediction With PyTorch

LSTM Text Generation with PyTorch - Complete Guide LSTM Text Generation with PyTorch A comprehensive guide to building word-level language models with Long Short-Term Memory networks Introduction to LSTM Text Generation Long Short-Term Memory (LSTM) networks are a special kind of recurrent neural network (RNN) capable of learning long-term dependencies. They are particularly useful for sequence prediction problems like text generation, where the context from previous words is crucial for predicting the next word. Key Concepts Word-level modeling : Predicts the next word given previous words Embeddings : Dense vector representations of words ...
Read more