Job Seek Algorithm using C++

-
Job Seek Algorithm using c++

#include<stdio.h>
#include<alloc.h>
#include<process.h>
#include<conio.h>

struct job
{
                int d,pro;
                struct job *pre,*next;
};

typedef struct
job node;

node *head,*jobc;

int f[100],front=0,rear=0;

void main()
{
                clrscr();
                int n;

                void insert(int,int);
                void display();
                void sort();
                void cal();
                int cal2();

                while(1)
                {

                                printf("\n\tJob Algorithm \n\t 1. Insert \n\t 2. Display \n\t 3. Get Maximum Profit\n\t 4.Exit");
                                printf("\n\tEnter Your Choice : ");

                                scanf("%d",&n);

                                if(n==4)
                                                break;

                                switch(n)
                                {

                                                int d,p;

                                                case 1:
                                                         printf("\n\tEnter Deadline : ");
                                                         scanf("%d",&d);

                                                                printf("\n\tEnter Profit : ");
                                                                scanf("%d",&p);

                                                                insert(d,p);
                                                                sort();

                                                                break;
                                                case 2:
                                                                display();
                                                                break;
                                                case 3:
                                                                jobc=NULL;
                                                                int profit;
                                                                cal();
                                                                profit = cal2();
                                                                printf("\n\tMax Profit is : %d",profit);
                                                                break;

                                }
                                getch();
                                clrscr();

                }

}

int getPro()
{
                node *tmp;
                if(jobc==NULL)
                {
                                printf("\n\tJobc Is Empty.");
                                return 0;
                } else {

                                tmp=jobc;
                                int po=0;
                                while(tmp!=NULL)
                                {
                                                po+=tmp->pro;
                                                printf("\n\tProfit : %d  DeadLine: %d",tmp->pro,tmp->d);
                                                tmp=tmp->next;
                                }
                                return po;
                }

}

int cal2()
{
                int setflag(int);
                node *tmp;

                if(head==NULL)
                                printf("\n\tList Is NULL");
                else
                {
                                tmp=head;
                                while(tmp!=NULL)
                                {
                                                                int flag = setflag(tmp->d);
                                                                printf("\t%d",flag);

                                                                if(flag>0)
                                                                {
                                                                                node *new1,*tmp1;
                                                                                new1=(node *)malloc(sizeof(node));
                                                                                new1->d=tmp->d;
                                                                                new1->pro=tmp->pro;
                                                                                if(jobc==NULL)
                                                                                {
                                                                                                new1->next=NULL;
                                                                                                new1->pre=NULL;
                                                                                                jobc=new1;
                                                                                }
                                                                                else
                                                                                {
                                                                                                tmp1=jobc;
                                                                                                while(tmp1->next!=NULL)
                                                                                                                tmp1=tmp1->next;

                                                                                                new1->next=NULL;
                                                                                                new1->pre=tmp1;
                                                                                                tmp1->next=new1;
                                                                                }
                                                                }
                                                tmp=tmp->next;
                                }
                                int po =getPro();
                                return po;
                }
}

int setflag(int d)
{
                if(d<front)
                {
                                return 0;
                }
                else if(f[d]==1)
                {
                       int n=setflag(d-1);
                       return n;
                }
                else
                {
                                f[d]=1;
                                return d;
                }
}

void cal()
{
                node *tmp;
                int m;
                tmp=head;
                m=tmp->d;

                while(tmp->next!=NULL)
                {
                                if(m<tmp->d)
                                                m=tmp->d;
                                tmp=tmp->next;
                }
                rear=m;
                for(int i=0;i<rear;i++)
                                f[i]=0;

}

void sort()
{
                node *tmp,*tmp1;
                if(head!=NULL)
                {
                                tmp=head;
                                while(tmp->next!=NULL)
                                {
                                                tmp1=tmp->next;
                                                while(tmp1!=NULL)
                                                {
                                                                int c,d;
                                                                if(tmp->pro<tmp1->pro)
                                                                {
                                                                                d=tmp1->d;
                                                                                tmp1->d=tmp->d;
                                                                                tmp->d=d;
                                                                                c=tmp1->pro;
                                                                                tmp1->pro=tmp->pro;
                                                                                tmp->pro=c;
                                                                }
                                                                tmp1=tmp1->next;
                                                }
                                                tmp=tmp->next;
                                }

                }

}

void display()
{
                node *tmp;
                if(head==NULL)
                                printf("\n\tList Is Empty.");
                else
                {
                                tmp=head;

                                while(tmp!=NULL)
                                {
                                                printf("\n\tDead Line : %d \t Profit : %d",tmp->d,tmp->pro);
                                                tmp=tmp->next;
                                }
                }
}



void insert(int d,int p)
{

                node *new1,*tmp;
                new1=(node *)malloc(sizeof(node));
                new1->d=d;
                new1->pro=p;
                if(head==NULL)
                {
                                new1->pre=NULL;
                                new1->next=NULL;
                                head=new1;
                }
                else
                {
                                tmp=head;
                                while(tmp->next!=NULL)
                                                tmp=tmp->next;

                                new1->next=NULL;
                                new1->pre=tmp;
                                tmp->next=new1;
                }
}






Location: Fandango Pass Rd, Lake City, CA 96115, USA

Comments

Post a Comment

Popular posts from this blog

date_diff function in php

-
////////////////////////////////////////////////////////////////////// //PARA: Date Should In YYYY-MM-DD Format //RESULT FORMAT: // '%y Year %m Month %d Day %h Hours %i Minute %s Seconds'        =>  1 Year 3 Month 14 Day 11 Hours 49 Minute 36 Seconds // '%y Year %m Month %d Day'                                    =>  1 Year 3 Month 14 Days // '%m Month %d Day'                                            =>  3 Month 14 Day // '%d Day %h Hours'                                            =>  14 Day 11 Hours // '%d Day'                                 ...
Read more

How to create a custom form in wordpress

-
// create table in database ( must add prefix ) // create page to display form i was wrote code into front-page.php                       Name: Email Selecet Resume: Submit if(isset($_POST['submitted'])) { global $wpdb; //print_r($_FILES['res']); $filename =  basename($_FILES['res']['name']); $path = get_template_directory()."/"."upload/resume/".$filename; //echo " "; $status = false; if(move_uploaded_file($_FILES['res']['tmp_name'], $path)) { $status = ture; } if($status == true) { $tablename=$wpdb->prefix.'resume'; $date = date("Y-m-d H:i:s A"); $data=array('name' => $_POST['contactName'], 'email...
Read more

m Coloring Problem using c or c++

-
m Coloring Problem using c or c++ Given an undirected graph and a number m, determine if the graph can be colored with at most m colors such that no two adjacent vertices of the graph are colored with the same color. Here coloring of a graph means the assignment of colors to all vertices. Input: 1) A 2D array graph[V][V] where V is the number of vertices in graph and graph[V][V] is adjacency matrix representation of the graph. A value graph[i][j] is 1 if there is a direct edge from i to j, otherwise graph[i][j] is 0. 2) An integer m which is a maximum number of colors that can be used. Output: An array color[V] that should have numbers from 1 to m. color[i] should represent the color assigned to the ith vertex. The code should also return false if the graph cannot be colored with m colors. Program: #include <stdio.h> #include <conio.h> #include <math.h> int m,n,x[10]={0},g[10][10]={0}; void main() {        ...
Read more