<?xml version="1.0" encoding="utf-8"?>

<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
	<channel>
		<title>DaniWeb IT Discussion Community - C</title>
		<link>http://www.daniweb.com/forums/</link>
		<description><![CDATA[Our C forum is the place for Q&A-style discussions related to the C language as per the ANSI C standard. Otherwise use our C++ forum.]]></description>
		<language>en-US</language>
		<lastBuildDate>Fri, 27 Nov 2009 12:39:28 GMT</lastBuildDate>
		<generator>vBulletin</generator>
		<ttl>60</ttl>
		<image>
			<url>http://www.daniweb.com/alphaimages/misc/rss.jpg</url>
			<title>DaniWeb IT Discussion Community - C</title>
			<link>http://www.daniweb.com/forums/</link>
		</image>
		<item>
			<title>how is this programm working?</title>
			<link>http://www.daniweb.com/forums/thread241766.html</link>
			<pubDate>Fri, 27 Nov 2009 10:37:54 GMT</pubDate>
			<description><![CDATA[Hi , 
 
I read that c is not a block structured language. 
means it does not allow defining functions inside other functions. 
 
but this code is not generating any error not even warnings, though we nest the functions. 
 
whats the story. 
  
  <div class="codeblock"> <div class="spaced"> <div...]]></description>
			<content:encoded><![CDATA[<div>Hi ,<br />
<br />
I read that c is not a block structured language.<br />
means it does not allow defining functions inside other functions.<br />
<br />
but this code is not generating any error not even warnings, though we nest the functions.<br />
<br />
whats the story.<br />
 <br />
 <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
int main()&nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; int num;<br />
&nbsp; &nbsp; &nbsp; &nbsp; num = 10;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int fun(int n)&nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;The local function&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; fun(num);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Main function&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Iam3R</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241766.html</guid>
		</item>
		<item>
			<title><![CDATA[[HELP]Averaging Filter 24bit BMP]]></title>
			<link>http://www.daniweb.com/forums/thread241746.html</link>
			<pubDate>Fri, 27 Nov 2009 07:34:39 GMT</pubDate>
			<description>Logic Used: 
Insert Pixel Data into a struct containing RGB values of the pixels 
read Data in a 3x3 array: | BGR(-1,-1) | BGR(-1,0) | BGR(-1,1) | 
                                         | BGR(0,-1)  | BGR(0,0)  | BGR(0,1)  | 
                                         | BGR(1,-1)  | BGR(1,0)  |...</description>
			<content:encoded><![CDATA[<div>Logic Used:<br />
Insert Pixel Data into a struct containing RGB values of the pixels<br />
read Data in a 3x3 array: | BGR(-1,-1) | BGR(-1,0) | BGR(-1,1) |<br />
                                         | BGR(0,-1)  | BGR(0,0)  | BGR(0,1)  |<br />
                                         | BGR(1,-1)  | BGR(1,0)  | BGR(1,1)  |<br />
Assign Average of all Blue,Green,Red components respectively to another struct containing RGB values and write the same<br />
to the output file<br />
<br />
Problem:Unexpected output,as seen in the bmp files attached in mail.The output image is supposed to be almost the same,except a little blurred.<br />
<br />
Input File:  o.bmp<br />
Output File: q.bmp<br />
<br />
 <pre style="margin:20px; line-height:13px">#define MASKSIZE 3<br />
#define INFILE &quot;o.bmp&quot;<br />
#define OUTFILE &quot;q.bmp&quot;<br />
<br />
/*------------Algorithm(Using Mask 3x3)---------------------------*/<br />
<br />
&nbsp; fp1=fopen(INFILE,&quot;rb&quot;);<br />
&nbsp; fp3=fopen(OUTFILE2,&quot;wb&quot;); <br />
<br />
&nbsp; fread((BYTE *)&amp;bmfh,sizeof(BITMAPFILEHEADER),1,fp1);<br />
&nbsp; fread((BYTE *)&amp;bmih,sizeof(BITMAPINFOHEADER),1,fp1);<br />
&nbsp; fwrite((BYTE *)&amp;bmfh,sizeof(BITMAPFILEHEADER),1,fp3);<br />
&nbsp; fwrite((BYTE *)&amp;bmih,sizeof(BITMAPINFOHEADER),1,fp3);<br />
&nbsp; fseek(fp1,bmfh.bfOffsetBits,SEEK_SET);&nbsp; &nbsp;  /*Set Position to Start of Pixel Data*/<br />
<br />
&nbsp; row=0;&nbsp; &nbsp; &nbsp; /*Offset for Row of Bitmap Array*/<br />
&nbsp; /*Begin Loop*/<br />
&nbsp; while(row&lt;bmih.biHeight)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; col=0;&nbsp; &nbsp; &nbsp; &nbsp;  /*Offset for Column of Bitmap Array*/<br />
&nbsp; &nbsp; &nbsp; while(col&lt;bmih.biWidth)<br />
&nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,(bmfh.bfOffsetBits)+(row * (bmih.biWidth * 3))+(col),SEEK_SET);&nbsp; /*Move to Next Pixel (central pixel on which mask coincides)*/<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; pos=ftell(fp1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; pos=pos-((bmih.biWidth *3) + MASKSIZE);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(row==0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(col==0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,0,SEEK_CUR);&nbsp; &nbsp; &nbsp; /*for poition (0,0) read pixel from (0,0)*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,ftell(fp1)-3,SEEK_CUR);&nbsp; /*for position(0,col) read pixel into array from previous pixel( - 3Bytes)*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(col==0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,ftell(fp1)-(bmih.biWidth *3),SEEK_CUR);&nbsp; /*for position(row,0) start reading into array from the pixel directly above current position*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(col == (bmih.biWidth)-1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,ftell(fp1)-((bmih.biWidth+1)*3),SEEK_CUR); /*for poition(row,Width-1) read pixel data into array at position (-1,-1) in a 3x3 array*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,ftell(fp1)-((bmih.biWidth+1)*3),SEEK_CUR); /*for position(row,col)*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*Begin Reading Pixel Data Into Array */<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(rowoff=-1;rowoff&lt;2;rowoff++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(coloff=-1;coloff&lt;2;coloff++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(row==0) /*Padding*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][-1].rgbtBlue=rgb[-1][0].rgbtBlue=rgb[-1][2].rgbtBlue=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][-1].rgbtGreen=rgb[-1][0].rgbtGreen=rgb[-1][2].rgbtGreen=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][-1].rgbtRed=rgb[-1][0].rgbtRed=rgb[-1][2].rgbtRed=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rowoff++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(col==0) /*Padding*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][-1].rgbtBlue=rgb[0][-1].rgbtBlue=rgb[1][-1].rgbtBlue=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][-1].rgbtGreen=rgb[0][-1].rgbtGreen=rgb[1][-1].rgbtGreen=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][-1].rgbtRed=rgb[0][-1].rgbtRed=rgb[1][-1].rgbtRed=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; coloff++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fread(pixel,1,sizeof(RGBTRIPLE),fp1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[rowoff][coloff].rgbtBlue=pixel-&gt;rgbtBlue;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[rowoff][coloff].rgbtGreen=pixel-&gt;rgbtGreen;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[rowoff][coloff].rgbtRed=pixel-&gt;rgbtRed;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(col==(bmih.biWidth-1)) /*Padding*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][1].rgbtBlue=rgb[0][1].rgbtBlue=rgb[1][1].rgbtBlue=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][1].rgbtGreen=rgb[0][1].rgbtGreen=rgb[1][1].rgbtGreen=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[-1][1].rgbtRed=rgb[0][1].rgbtRed=rgb[1][1].rgbtRed=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; coloff++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(row==(bmih.biHeight)) /*Padding*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[1][-1].rgbtBlue=rgb[1][0].rgbtBlue=rgb[1][1].rgbtBlue=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[1][-1].rgbtGreen=rgb[1][0].rgbtGreen=rgb[1][1].rgbtGreen=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rgb[1][-1].rgbtRed=rgb[1][0].rgbtRed=rgb[1][1].rgbtRed=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; rowoff++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fseek(fp1,((bmih.biWidth)*3)+(MASKSIZE),SEEK_CUR);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*Finish Read*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*Begin Averaging Array color value*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=-1;i&lt;2;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(j=-1;j&lt;2;j++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Blue=(Blue+(rgb[i][j].rgbtBlue))/9;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Green=(Green+(rgb[i][j].rgbtGreen))/9;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Red=(Red+(rgb[i][j].rgbtRed))/9;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*Averaging Finish*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*Write Averaged Values Into Fil*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; pixel-&gt;rgbtBlue=Blue;<br />
&nbsp; &nbsp; &nbsp; &nbsp; pixel-&gt;rgbtGreen=Green;<br />
&nbsp; &nbsp; &nbsp; &nbsp; pixel-&gt;rgbtRed=Red;<br />
&nbsp; &nbsp; &nbsp; &nbsp; fwrite(pixel,1,sizeof(RGBTRIPLE),fp3);<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*Finish Writing*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; col++;<br />
&nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; row++;<br />
&nbsp; &nbsp; }<br />
&nbsp; /*End Loop*/</pre><br />
Input Image:<br />
<img src="http://www.daniweb.com/forums/attachment.php?attachmentid=12733&amp;stc=1&amp;d=1259307546" border="0" alt="" /><br />
<br />
Output Image:<br />
<img src="http://www.daniweb.com/forums/attachment.php?attachmentid=12734&amp;stc=1&amp;d=1259307546" border="0" alt="" /></div>  <br /> <div style="padding:5px">    <fieldset class="fieldset"> <legend>Attached Images</legend> <table cellpadding="0" cellspacing="5" border="0"> <tr> <td><img class="inlineimg" src="http://www.daniweb.com/forums/images/attach/bmp.gif" alt="File Type: bmp" width="16" height="16" border="0" style="vertical-align:baseline" /></td> <td><a href="http://www.daniweb.com/forums/attachment.php?attachmentid=12733&amp;d=1259307650" target="_blank">o.bmp</a> (126.6 KB)</td> </tr><tr> <td><img class="inlineimg" src="http://www.daniweb.com/forums/images/attach/bmp.gif" alt="File Type: bmp" width="16" height="16" border="0" style="vertical-align:baseline" /></td> <td><a href="http://www.daniweb.com/forums/attachment.php?attachmentid=12734&amp;d=1259307672" target="_blank">q.bmp</a> (126.6 KB)</td> </tr> </table> </fieldset>   </div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>imagine88</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241746.html</guid>
		</item>
		<item>
			<title>System date in C</title>
			<link>http://www.daniweb.com/forums/thread241737.html</link>
			<pubDate>Fri, 27 Nov 2009 05:59:00 GMT</pubDate>
			<description><![CDATA[Sorry, solved my own problem.   
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div>...]]></description>
			<content:encoded><![CDATA[<div>Sorry, solved my own problem.  <br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;time.h&gt;<br />
<br />
&nbsp;time_t current = time(NULL);<br />
&nbsp; char date[11];<br />
<br />
&nbsp; strftime (date, 11, &quot;%m/%d/%Y&quot;, localtime (&amp;current));</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Mattpd</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241737.html</guid>
		</item>
		<item>
			<title>Question about newline character</title>
			<link>http://www.daniweb.com/forums/thread241788.html</link>
			<pubDate>Fri, 27 Nov 2009 00:02:30 GMT</pubDate>
			<description><![CDATA[can we type while ( "variable" = '\n') ? or an error will occur?]]></description>
			<content:encoded><![CDATA[<div>can we type while ( &quot;variable&quot; = '\n') ? or an error will occur?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>rel0aded911</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241788.html</guid>
		</item>
		<item>
			<title>Small problem with structures</title>
			<link>http://www.daniweb.com/forums/thread241652.html</link>
			<pubDate>Thu, 26 Nov 2009 20:11:31 GMT</pubDate>
			<description><![CDATA[I am trying to take a user's input and assign it to a certain part of a structure.  This code is in my book so I assume it's correct: 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>I am trying to take a user's input and assign it to a certain part of a structure.  This code is in my book so I assume it's correct:<br />
 <pre style="margin:20px; line-height:13px">scanf(&quot;%d&quot;, &amp;part_number);<br />
inventory[num_parts].number = part_number;</pre>I need to do the same thing but with a string instead of a number, but I get incompatible types in assignment error.<br />
 <pre style="margin:20px; line-height:13px">scanf(&quot;%s&quot;, &amp;part_name);<br />
inventory[num_parts].name = part_name;</pre>How could I accomplish this?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Mattpd</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241652.html</guid>
		</item>
		<item>
			<title>Graphic programming</title>
			<link>http://www.daniweb.com/forums/thread241609.html</link>
			<pubDate>Thu, 26 Nov 2009 15:05:29 GMT</pubDate>
			<description><![CDATA[I need help in Graphic programming in C. I donno how to start. 
I use Visual C++ compiler which doesn't support <graphics.h>  
Please somebody help. I can't find anything!:sad:]]></description>
			<content:encoded><![CDATA[<div>I need help in Graphic programming in C. I donno how to start.<br />
I use Visual C++ compiler which doesn't support &lt;graphics.h&gt; <br />
Please somebody help. I can't find anything!:sad:</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>DavidBrown1</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241609.html</guid>
		</item>
		<item>
			<title>Using pointers to find the sum of two matrices</title>
			<link>http://www.daniweb.com/forums/thread241566.html</link>
			<pubDate>Thu, 26 Nov 2009 12:54:02 GMT</pubDate>
			<description>Please, I need help in finding the sum of two matrices using pointers. Thanks.</description>
			<content:encoded><![CDATA[<div>Please, I need help in finding the sum of two matrices using pointers. Thanks.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>imolorhe</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241566.html</guid>
		</item>
		<item>
			<title><![CDATA[it won't work the way i want it]]></title>
			<link>http://www.daniweb.com/forums/thread241547.html</link>
			<pubDate>Thu, 26 Nov 2009 10:56:25 GMT</pubDate>
			<description><![CDATA[im using borland 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C...]]></description>
			<content:encoded><![CDATA[<div>im using borland<br />
 <pre style="margin:20px; line-height:13px">/*Write a function that will scan/read each line of a given text file<br />
and determine whether a line is valid or invalid. A line is said to be valid<br />
if and only if it satisfies the ff:<br />
a. the line is composed only of characters a and b<br />
b. the line contains an equal number of a's and b's<br />
The function must display valid/invalid as the case may be*/<br />
<br />
# include &lt;stdio.h&gt;<br />
# include &lt;conio.h&gt;<br />
# include &lt;stdlib.h&gt;<br />
# include &lt;string.h&gt;<br />
<br />
void main(void)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; FILE *fp;<br />
&nbsp; &nbsp; &nbsp; &nbsp; char str[100];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i,stop,a,b;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if((fp=fopen(&quot;detvalid.txt&quot;,&quot;rt&quot;))!=NULL)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp;  while (!feof(fp))<br />
&nbsp; &nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fgets(str,100,fp);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; stop=0;a=b=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;strlen(str)&amp;&amp;!stop;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(str[i]=='a')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; a++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if(str[i]=='b')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; b++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; stop++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  if (stop||a!=b)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;invalid\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;valid\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp;  fclose(fp);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>D_switch</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241547.html</guid>
		</item>
		<item>
			<title>float and double precission</title>
			<link>http://www.daniweb.com/forums/thread241546.html</link>
			<pubDate>Thu, 26 Nov 2009 10:47:16 GMT</pubDate>
			<description><![CDATA[Hi  
i have written a program to check the precision of float and double values. 
 i read that the precision of float is 6 digits and double is 10. 
but it is showing only 6 for both. 
 
do we need to make any arrangement for the system to print the correct precission. 
 
 
  <div...]]></description>
			<content:encoded><![CDATA[<div>Hi <br />
i have written a program to check the precision of float and double values.<br />
 i read that the precision of float is 6 digits and double is 10.<br />
but it is showing only 6 for both.<br />
<br />
do we need to make any arrangement for the system to print the correct precission.<br />
<br />
<br />
 <pre style="margin:20px; line-height:13px">[Shark@localhost Fresh]$ gcc flt_dbl_prec.c<br />
[Shark@localhost Fresh]$ ./a.out<br />
34.345676 <br />
34.345678<br />
[Shark@localhost Fresh]$ cat flt_dbl_prec.c<br />
int&nbsp; main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; float f = 34.34567832;<br />
&nbsp; &nbsp; &nbsp; &nbsp; double d= 34.3456783221;<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%f\n&quot;,f);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%lf\n&quot;,d);<br />
return 0;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Iam3R</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241546.html</guid>
		</item>
		<item>
			<title>Light weight (opensource/free) IDE for C programming?</title>
			<link>http://www.daniweb.com/forums/thread241478.html</link>
			<pubDate>Thu, 26 Nov 2009 06:30:11 GMT</pubDate>
			<description><![CDATA[Hello,  
 
Can anyone recommend an _light weight_ IDE for C development? Preferably open source, but definitely free. (for Windows) 
 
It doesn't need to have its own version control - I'm using subversion - a plugin to subversion would be nice but it okay if it doesn't. 
 
Currently my colleague...]]></description>
			<content:encoded><![CDATA[<div>Hello, <br />
<br />
Can anyone recommend an <span style="text-decoration:underline">light weight</span> IDE for C development? Preferably open source, but definitely free. (for Windows)<br />
<br />
It doesn't need to have its own version control - I'm using subversion - a plugin to subversion would be nice but it okay if it doesn't.<br />
<br />
Currently my colleague is using Borland C++ to develop and compile C code. It looks a little heavy and I'd prefer to use something much simpler. <br />
<br />
Thanks in advance, Michelle</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>michelle1</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241478.html</guid>
		</item>
		<item>
			<title>Threaded Socket Issue</title>
			<link>http://www.daniweb.com/forums/thread241415.html</link>
			<pubDate>Thu, 26 Nov 2009 01:31:39 GMT</pubDate>
			<description><![CDATA[Hello all, 
 
I'm working on a school project (in C) that I'm having some issues with.  I have a number of threads which recursively send information between one another via sockets.  The structure for the recursive case is as follows.. 
 
Loop For A Long Time { 
    Receive From Predecessor 
   ...]]></description>
			<content:encoded><![CDATA[<div>Hello all,<br />
<br />
I'm working on a school project (in C) that I'm having some issues with.  I have a number of threads which recursively send information between one another via sockets.  The structure for the recursive case is as follows..<br />
<br />
Loop For A Long Time {<br />
    Receive From Predecessor<br />
    Respond To Predecessor<br />
    Process Info<br />
        Create Successor If Necessary<br />
    Send To Successor<br />
    Wait For Response From Successor<br />
}<br />
<br />
The first thread just processes info, sends it to the info, and waits for a response.  The last thread just receives and processes info.<br />
<br />
I'm having a problem that results from the following sequence of events (call a given thread B, its predecessor A, and its successor C): B sends some info to C and waits for a response, then A gets the CPU, computes some info, sends it to B, and waits for a response.  At this point both A and B are blocking, so C goes and responds to B.  Then B tries to get the info that A sent it.  The problem is that <span style="font-style:italic">sometimes</span> the messages that A sent to B is no longer there (B receives something, because it stops blocking, but its zero length).  B has separate sockets for A and C, so I don't believe any problem should arise from the fact that C sends a message to B (that is, B receives it as well) while A has a message that's waiting to be received by B.  It would seem this is caused by a race condition, but there's no shared data that are written to.<br />
<br />
Does anyone have any ideas as to why this might be happening?<br />
<br />
The entirety of the code follows (it's quite long, sorry).  The main is essentially a server that creates the new threads.  sieve_thread is the recursive case, and every one runs in its own thread.  initial is the base case, and runs in its own thread.<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;sys/types.h&gt;<br />
#include &lt;sys/socket.h&gt;<br />
#include &lt;netinet/in.h&gt;<br />
#include &lt;netdb.h&gt;<br />
#include &lt;string.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;pthread.h&gt;<br />
#include &lt;math.h&gt;<br />
#include &lt;semaphore.h&gt;<br />
#include &lt;signal.h&gt;<br />
<br />
#define PORT 57102<br />
#define MSG_LENGTH 1000<br />
#define LIST_LENGTH 500<br />
#define RESULTS_LENGTH 1000000<br />
<br />
int max;<br />
int max_sqrt;<br />
<br />
int done = -1;<br />
int cont = 1;<br />
int new = 0;<br />
<br />
sem_t sem1;<br />
sem_t sem2;<br />
int most_recent_port = PORT;<br />
<br />
void sieve_thread(void*);<br />
void initial();<br />
<br />
int main(int argc, char* argv[]) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; char msg[MSG_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int socket_main, socket_current, cc, fromlen, tolen;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int addrlen;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in me;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in them;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int result, response;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int stop = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int yes = 1;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; sem_init(&amp;sem1, 0, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; sem_init(&amp;sem2, 0, 0);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; sigset(SIGPIPE, SIG_IGN);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Get Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_main = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_main == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (setsockopt(socket_main, SOL_SOCKET, SO_REUSEADDR, &amp;yes, sizeof(int)) == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;setsockopt&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Build My Struct<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(&amp;me, 0, sizeof(me));<br />
&nbsp; &nbsp; &nbsp; &nbsp; me.sin_family = AF_INET;<br />
&nbsp; &nbsp; &nbsp; &nbsp; me.sin_addr.s_addr = INADDR_ANY;<br />
&nbsp; &nbsp; &nbsp; &nbsp; me.sin_port = htons(PORT);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Bind<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;server bound to %i\n&quot;, PORT);<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = bind(socket_main, (struct sockaddr *) &amp;me, sizeof(struct sockaddr));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;bind&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Listen<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = listen(socket_main, 20);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;listen&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (argc &gt; 1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; max = atoi(argv[1]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pthread_t thread;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pthread_create(&amp;thread, NULL, (void*) &amp;initial, NULL);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; sem_wait(&amp;sem1);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; while (!stop) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Accept<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; socket_current = accept(socket_main, (struct sockaddr*) &amp;them, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (socket_current == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;accept&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Recieve<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(msg, '\0', MSG_LENGTH);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_current, &amp;response, sizeof(int), 0, (struct sockaddr*) &amp;them, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (server 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_current);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;server recieved: %i\n&quot;, response);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (response &gt; 0) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; max = response;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; max_sqrt = (int) sqrt(max) + 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // New Thread<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (response &gt;= 0) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pthread_t thread;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pthread_create(&amp;thread, NULL, (void*) &amp;sieve_thread, (void*) (most_recent_port + 1));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sem_wait(&amp;sem2);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;server sent: %i\n&quot;, most_recent_port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_current, &amp;most_recent_port, sizeof(int), 0, (struct sockaddr*) &amp;them, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (server 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_current);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (response == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; stop = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_current);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Close Stuff<br />
&nbsp; &nbsp; &nbsp; &nbsp; //close(socket_current);<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; sleep(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;server exiting\n&quot;);<br />
}<br />
<br />
// Sieve Thread<br />
void sieve_thread(void* _port) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; char msg[MSG_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int socket_server, socket_server_sub, socket_predecessor, socket_predecessor_sub, socket_successor, socket_successor_sub;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in me;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in server;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in successor;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in predecessor;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int result, response, response_length;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int stop = 0, stop_all = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list_recieve[LIST_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list_recieve_length;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list_send[LIST_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list_results[RESULTS_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int* list_tmp;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list_tmp_index = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i, j, k = 0, x = 0, yes = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int prime = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct hostent* host;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int created_successor = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int port = (int) _port;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Get Predecessor Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_predecessor = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_predecessor == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: socket 1 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (setsockopt(socket_predecessor, SOL_SOCKET, SO_REUSEADDR, &amp;yes, sizeof(int)) == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;setsockopt&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Build My Struct<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(&amp;me, 0, sizeof(me));<br />
&nbsp; &nbsp; &nbsp; &nbsp; me.sin_family = AF_INET;<br />
&nbsp; &nbsp; &nbsp; &nbsp; me.sin_addr.s_addr = INADDR_ANY;<br />
&nbsp; &nbsp; &nbsp; &nbsp; me.sin_port = htons(port);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Bind<br />
&nbsp; &nbsp; &nbsp; &nbsp; while ((result = bind(socket_predecessor, (struct sockaddr *) &amp;me, sizeof(struct sockaddr))) == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; me.sin_port = htons(port++);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i bind collision\n&quot;, port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //result = bind(socket_predecessor, (struct sockaddr *) &amp;me, sizeof(struct sockaddr));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /*if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;Error: bind (thread %i)\n&quot;, (int)port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  perror(&quot;bind (thread 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; most_recent_port = port;<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread bound to %i (%i)\n&quot;, port, (int)_port);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Listen For Predecessor<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = listen(socket_predecessor, 20);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;listen&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i listening\n&quot;, (int) port);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; sem_post(&amp;sem2);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Accept From Predecessor<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_predecessor_sub = accept(socket_predecessor, (struct sockaddr*) &amp;predecessor, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_predecessor_sub == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: accept (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;accept (1 in thread)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(list_send, 0, LIST_LENGTH);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; while (!stop) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i accepting\n&quot;, (int) port);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Recieve list from predecessor<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(list_recieve, 0, LIST_LENGTH);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; response_length = recvfrom(socket_predecessor_sub, list_recieve, LIST_LENGTH * sizeof(list_recieve), 0, (struct sockaddr*) &amp;predecessor, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (response_length == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: recv 1 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (thread 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i recieved (1): %i, length: %i\n&quot;, (int) port, list_recieve[0], response_length);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // If our predecessor isn't done sending<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (list_recieve[0] != -1 &amp;&amp; response_length != 0) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_recieve_length = response_length / sizeof(int);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Send response to predecessor so they can continue<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i sent (1): %i\n&quot;, (int) port, cont);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_predecessor_sub, &amp;cont, sizeof(cont), 0, (struct sockaddr*) &amp;predecessor, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: send 1 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (thread 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Set Prime<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (prime == 0) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; prime = list_recieve[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (prime &gt;= max_sqrt) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; stop_all = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;STOP ALL (thread %i) -------------------------\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_tmp = (int*) malloc(RESULTS_LENGTH * sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(list_tmp, 0, RESULTS_LENGTH * sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (!stop_all) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Update send list<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i recieved entries: %i, prime: %i\n&quot;, (int) port, (response_length / sizeof(int)), prime);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; list_recieve_length &amp;&amp; k &lt; LIST_LENGTH; i++) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;&nbsp;  thread %i testing %i\n&quot;, (int)port, list_recieve[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (list_recieve[i] % prime != 0 &amp;&amp; list_recieve &gt; 0) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_send[k++] = list_recieve[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } else {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; list_recieve_length &amp;&amp; k &lt; LIST_LENGTH; i++) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;&nbsp;  thread %i storing %i\n&quot;, (int)port, list_recieve[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_tmp[list_tmp_index++] = list_recieve[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } else {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; stop = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Send list to successor<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if ((k &gt; 1 || (stop &amp;&amp; k &gt; 1)) &amp;&amp; !stop_all) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //if ((k == LIST_LENGTH || (stop &amp;&amp; k &gt; 1)) &amp;&amp; !stop_all) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Create Successor<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (!created_successor) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i creating successor\n&quot;, (int) port);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Create Server Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; socket_server = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (socket_server == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Build Server Struct<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(&amp;server, 0, sizeof(server));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; server.sin_family = AF_INET;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; server.sin_port = htons(PORT);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; host = gethostbyname(&quot;mikey.cs.uwec.edu&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; inet_aton(host-&gt;h_addr, &amp;(server.sin_addr));<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Connect to Server<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i connecting to %i\n&quot;, (int) port, PORT);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; socket_server_sub = connect(socket_server, (struct sockaddr *) &amp;server, sizeof(server));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (socket_server_sub == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Send Port Request to Server<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i sent (2): %i\n&quot;, (int)port, new);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_server, &amp;new, sizeof(new), 0, (struct sockaddr*) &amp;server, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: send 2 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (thread 2)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Recieve Successor Port<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_server, &amp;response, sizeof(response), 0, (struct sockaddr*) &amp;server, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: recv 2 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (thread 2)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i recieved (2): %i\n&quot;, (int) port, response);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Disconnect From Server<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Connect to successor if the server gave us one<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (response != -1) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Create Sucessor Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; socket_successor = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (socket_successor == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Build Successor Struct<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(&amp;successor, 0, sizeof(successor));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; successor.sin_family = AF_INET;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; successor.sin_port = htons(response);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; host = gethostbyname(&quot;data.cs.uwec.edu&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; inet_aton(host-&gt;h_addr, &amp;(successor.sin_addr));<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Connect to Successor<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i connecting to %i\n&quot;, (int) port, response);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; socket_successor_sub = connect(socket_successor, (struct sockaddr *) &amp;successor, sizeof(successor));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (socket_successor_sub == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; created_successor = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (created_successor) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Send list to successor<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i sent (3): %i, length: %i\n&quot;, (int) port, list_send[0], k * sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_successor, list_send, k * sizeof(int), 0, (struct sockaddr*) &amp;successor, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: send 3 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (thread 3)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Get Response<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_successor, &amp;response, sizeof(int), 0, (struct sockaddr*) &amp;successor, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: recv 3 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (thread 3)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i recieved (3): %i\n&quot;, (int) port, response);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(list_send, 0, LIST_LENGTH);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i done with loop\n&quot;, (int) port);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Prepare Results<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(list_results, 0, RESULTS_LENGTH * sizeof(int));<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // If not last<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (created_successor) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Send done signal to successor<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i sent (4): %i\n&quot;, port, done);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_successor, &amp;done, sizeof(int), 0, (struct sockaddr*) &amp;successor, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: send 4 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (thread 4)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Wait for successors results<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i waiting\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; response_length = recvfrom(socket_successor, &amp;list_results, RESULTS_LENGTH * sizeof(int), 0, (struct sockaddr*) &amp;successor, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (response_length == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: recv 4 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (thread 4)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i recieved (4): %i, length: %i\n&quot;, (int) port,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_results[0], response_length);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k = response_length / sizeof(int) + 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_results[k - 1] = prime;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;appending prime: %i\n&quot;, prime);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // If last, add all that remains in list<br />
&nbsp; &nbsp; &nbsp; &nbsp; else {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i creating results list\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (i = list_tmp_index - 1; i &gt; 0; i--) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;PRIME: %i\n&quot;, list_results[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_results[k++] = list_tmp[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;PRIME: %i\n&quot;, prime);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list_results[k++] = prime;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Send results to predecessor<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i sent (5): %i, length: %i\n&quot;, (int) port, list_results[0], k * sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_predecessor_sub, &amp;list_results, k * sizeof(int), 0, (struct sockaddr*) &amp;predecessor, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error: send 5 (thread %i)\n&quot;, (int) port);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (thread 5)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_successor);<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor_sub);<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_predecessor);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;thread %i exiting\n&quot;, (int) port);<br />
}<br />
<br />
void initial() {<br />
&nbsp; &nbsp; &nbsp; &nbsp; int socket_main, socket_server, socket_thread;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct sockaddr_in server, thread;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct hostent* host;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int result, response, i, j, k;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int yes = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; char msg[MSG_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list[LIST_LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int list_results[RESULTS_LENGTH];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Create Server Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_main = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_main == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Build Server Struct<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(&amp;server, 0, sizeof(server));<br />
&nbsp; &nbsp; &nbsp; &nbsp; server.sin_family = AF_INET;<br />
&nbsp; &nbsp; &nbsp; &nbsp; server.sin_port = htons(PORT);<br />
&nbsp; &nbsp; &nbsp; &nbsp; host = gethostbyname(&quot;mikey.cs.uwec.edu&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; inet_aton(host-&gt;h_addr, &amp;(server.sin_addr));<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Connect to Server<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base connecting to %i\n&quot;, PORT);<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_server = connect(socket_main, (struct sockaddr *) &amp;server, sizeof(server));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_server == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Send Port Request to Server<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base sent: %i\n&quot;, max);<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_main, &amp;max, sizeof(max), 0, (struct sockaddr*) &amp;server, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (base 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; sem_post(&amp;sem1);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Recieve Port<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_main, &amp;response, sizeof(response), 0, (struct sockaddr*) &amp;server, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (base 1)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base recieved (1): %i\n&quot;, response);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Disconnect<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Create Thread Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_main = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_main == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Build Thread Struct<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(&amp;thread, 0, sizeof(thread));<br />
&nbsp; &nbsp; &nbsp; &nbsp; thread.sin_family = AF_INET;<br />
&nbsp; &nbsp; &nbsp; &nbsp; thread.sin_port = htons(response);<br />
&nbsp; &nbsp; &nbsp; &nbsp; host = gethostbyname(&quot;data.cs.uwec.edu&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; inet_aton(host-&gt;h_addr, &amp;(thread.sin_addr));<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Connect to Thread<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base connecting to %i\n&quot;, response);<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_thread = connect(socket_main, (struct sockaddr *) &amp;thread,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sizeof(thread));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_thread == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Build &amp; Send List<br />
&nbsp; &nbsp; &nbsp; &nbsp; memset(list, 0, LIST_LENGTH);<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 2, j = 0; i &lt;= max; i++) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; list[j] = i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; j++;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Send Message<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (j == LIST_LENGTH) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base sent: %i, length: %i\n&quot;, list[0], j * sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_main, list, j * sizeof(int), 0, (struct sockaddr*) &amp;thread, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (base 2)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Get Response<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_main, &amp;response, sizeof(int), 0, (struct sockaddr*) &amp;thread, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (base 2)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base recieved (2): %i\n&quot;, response);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; memset(msg, '\0', MSG_LENGTH);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; j = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Send Message<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (j &gt; 0) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base sent: %i, length: %i\n&quot;, list[0], j * sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_main, list, j * sizeof(int), 0, (struct sockaddr*) &amp;thread, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (base 3)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // Get Response<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_main, &amp;response, sizeof(int), 0, (struct sockaddr*) &amp;thread, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (base 3)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base recieved (3): %i\n&quot;, response);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Send Message<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base sent: %i\n&quot;, done);<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_main, &amp;done, sizeof(int), 0, (struct sockaddr*) &amp;thread, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; //result = send(socket_main, &amp;done, sizeof(int), 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (base 4)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; } else {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base sent length: %i\n&quot;, result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Get Response<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base waiting\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sizeof(struct sockaddr_in);<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = recvfrom(socket_main, &amp;list_results, RESULTS_LENGTH * sizeof(int), 0, (struct sockaddr*) &amp;thread, &amp;result);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;recv (base 4)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = result / sizeof(int) - 1; i &gt;= 0; i--) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%i\n&quot;, list_results[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Close the Sockets<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_thread);<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Create Thread Socket<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_main = socket(AF_INET, SOCK_STREAM, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_main == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Connect to Thread<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base connecting to %i\n&quot;, response);<br />
&nbsp; &nbsp; &nbsp; &nbsp; socket_thread = connect(socket_main, (struct sockaddr *) &amp;server, sizeof(server));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (socket_thread == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;socket&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; result = sendto(socket_main, &amp;done, sizeof(int), 0, (struct sockaddr*) &amp;server, sizeof(struct sockaddr_in));<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (result == -1) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;send (base 5)&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_server);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; close(socket_main);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; // Give client a chance to properly shutdown<br />
&nbsp; &nbsp; &nbsp; &nbsp; //&nbsp; &nbsp; &nbsp; sleep(10);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;base exiting\n&quot;);<br />
<br />
}</pre><br />
Here is some sample output.  The thread 57103 receives a 0 length message at line 63, but it should've received the 2000 byte message sent by base at line 40.<br />
<br />
 <pre style="margin:20px; line-height:13px">[konsorpc@mikey project3]$ sieve 2000<br />
server bound to 57102<br />
base connecting to 57102<br />
base sent: 2000<br />
server recieved: 2000<br />
thread bound to 57103 (57103)<br />
thread 57103 listening<br />
server sent: 57103<br />
base recieved (1): 57103<br />
base connecting to 57103<br />
base sent: 2, length: 2000<br />
thread 57103 accepting<br />
thread 57103 recieved (1): 2, length: 2000<br />
thread 57103 sent (1): 1<br />
thread 57103 recieved entries: 500, prime: 2<br />
thread 57103 creating successor<br />
base recieved (2): 1<br />
base sent: 502, length: 2000<br />
thread 57103 connecting to 57102<br />
thread 57103 sent (2): 0<br />
server recieved: 0<br />
thread bound to 57104 (57104)<br />
thread 57104 listening<br />
server sent: 57104<br />
thread 57103 recieved (2): 57104<br />
thread 57103 connecting to 57104<br />
thread 57103 sent (3): 3, length: 1000<br />
thread 57104 accepting<br />
thread 57104 recieved (1): 3, length: 1000<br />
thread 57104 sent (1): 1<br />
thread 57104 recieved entries: 250, prime: 3<br />
thread 57104 creating successor<br />
thread 57103 recieved (3): 1<br />
thread 57103 accepting<br />
thread 57103 recieved (1): 502, length: 2000<br />
thread 57103 sent (1): 1<br />
thread 57103 recieved entries: 500, prime: 2<br />
thread 57103 sent (3): 503, length: 1000<br />
base recieved (2): 1<br />
base sent: 1002, length: 2000<br />
thread 57104 connecting to 57102<br />
thread 57104 sent (2): 0<br />
server recieved: 0<br />
thread bound to 57105 (57105)<br />
thread 57105 listening<br />
server sent: 57105<br />
thread 57104 recieved (2): 57105<br />
thread 57104 connecting to 57105<br />
thread 57104 sent (3): 5, length: 664<br />
thread 57105 accepting<br />
thread 57105 recieved (1): 5, length: 664<br />
thread 57105 sent (1): 1<br />
thread 57105 recieved entries: 166, prime: 5<br />
thread 57105 creating successor<br />
thread 57104 recieved (3): 1<br />
thread 57104 accepting<br />
thread 57104 recieved (1): 503, length: 1000<br />
thread 57104 sent (1): 1<br />
thread 57104 recieved entries: 250, prime: 3<br />
thread 57104 sent (3): 503, length: 668<br />
thread 57103 recieved (3): 1<br />
thread 57103 accepting<br />
thread 57103 recieved (1): 0, length: 0<br />
thread 57103 done with loop<br />
thread 57105 connecting to 57102<br />
thread 57105 sent (2): 0<br />
server recieved: 0<br />
thread bound to 57106 (57106)<br />
thread 57106 listening<br />
server sent: 57106<br />
thread 57105 recieved (2): 57106<br />
thread 57105 connecting to 57106<br />
thread 57105 sent (3): 7, length: 532<br />
thread 57106 accepting<br />
thread 57106 recieved (1): 7, length: 532<br />
thread 57106 sent (1): 1<br />
thread 57106 recieved entries: 133, prime: 7<br />
thread 57106 creating successor<br />
thread 57105 recieved (3): 1<br />
thread 57105 accepting<br />
thread 57105 recieved (1): 503, length: 668<br />
thread 57105 sent (1): 1<br />
thread 57105 recieved entries: 167, prime: 5<br />
thread 57105 sent (3): 503, length: 532<br />
thread 57104 recieved (3): 1<br />
thread 57104 accepting<br />
thread 57104 recieved (1): 1002, length: 2000<br />
thread 57104 sent (1): 1<br />
thread 57104 recieved entries: 500, prime: 3<br />
thread 57104 sent (3): 1003, length: 1332<br />
base recieved (2): 1<br />
base sent: 1502, length: 1996<br />
thread 57106 connecting to 57102<br />
thread 57106 sent (2): 0<br />
server recieved: 0<br />
thread bound to 57107 (57107)<br />
thread 57107 listening<br />
server sent: 57107<br />
thread 57106 recieved (2): 57107<br />
thread 57106 connecting to 57107<br />
thread 57106 sent (3): 11, length: 456<br />
thread 57107 accepting<br />
thread 57107 recieved (1): 11, length: 456<br />
thread 57107 sent (1): 1<br />
thread 57107 recieved entries: 114, prime: 11<br />
thread 57107 creating successor<br />
thread 57106 recieved (3): 1<br />
thread 57106 accepting<br />
thread 57106 recieved (1): 503, length: 532<br />
thread 57106 sent (1): 1<br />
thread 57106 recieved entries: 133, prime: 7<br />
thread 57106 sent (3): 503, length: 452<br />
thread 57105 recieved (3): 1<br />
thread 57105 accepting<br />
thread 57105 recieved (1): 0, length: 0<br />
thread 57105 done with loop<br />
thread 57107 connecting to 57102<br />
thread 57107 sent (2): 0<br />
server recieved: 0<br />
thread bound to 57108 (57108)<br />
thread 57108 listening<br />
server sent: 57108<br />
thread 57107 recieved (2): 57108<br />
thread 57107 connecting to 57108<br />
thread 57107 sent (3): 13, length: 412<br />
thread 57108 accepting<br />
thread 57108 recieved (1): 13, length: 412<br />
thread 57108 sent (1): 1<br />
thread 57108 recieved entries: 103, prime: 13<br />
thread 57108 creating successor<br />
thread 57107 recieved (3): 1<br />
thread 57107 accepting<br />
thread 57107 recieved (1): 503, length: 452<br />
thread 57107 sent (1): 1<br />
thread 57107 recieved entries: 113, prime: 11<br />
thread 57107 sent (3): 503, length: 412<br />
thread 57106 recieved (3): 1<br />
thread 57106 accepting<br />
thread 1956 recieved (1): 1003, length: 3328<br />
thread 1956 sent (1): 1<br />
Error: send 1 (thread 1956)<br />
send (thread 1): Bad file descriptor</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>patrickkonsor</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241415.html</guid>
		</item>
		<item>
			<title>Mysql C API and Asterisk AGI</title>
			<link>http://www.daniweb.com/forums/thread241412.html</link>
			<pubDate>Thu, 26 Nov 2009 01:22:58 GMT</pubDate>
			<description><![CDATA[Hello. I'm currently developing an IVR system under Asterisk through the Asterisk Gateway Interface (AGI), connecting to a Mysql server using the Mysql C API.  
The server returns a ticket number that I have to say to the client, so I developed a TTS (Text To Speech) algorithm to say a specific...]]></description>
			<content:encoded><![CDATA[<div>Hello. I'm currently developing an IVR system under Asterisk through the Asterisk Gateway Interface (AGI), connecting to a Mysql server using the Mysql C API. <br />
The server returns a ticket number that I have to say to the client, so I developed a TTS (Text To Speech) algorithm to say a specific number (13000) to the client for testing, by using the AGI application Stream File, and playing two sound files back to back, thirteen.gsm and thousand.gsm, so the caller can hear the ticket number &quot;Thirteen Thousand&quot;<br />
The problem is this: on the Asterisk debug console I can see that the Stream File (&quot;thirteen&quot;) and Stream File(&quot;thousand&quot;) functions work, but can hear no sound whatsoever on the softphone. The sound files play fine on other sound players and so do other AGI applications using the Stream File function.<br />
<br />
The code below basically copies the number returned by the server (13000 for this test) on the array 'numero', then checks the first and second numbers to be '1' and '3' (I omit the latter since I know they're zero) then play the files through the AGI functions Stream File.<br />
I'm guessing it has to do with being connected to the server while playing files or something. <br />
Any ideas?<br />
 <pre style="margin:20px; line-height:13px">while ((row = mysql_fetch_row(res)) != NULL)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(prueba[0],row[0]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; j=strlen(prueba[0]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (i=0; i&lt;j; i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (prueba[0][i]=='0' || prueba[0][i]=='1' || prueba[0][i]=='2' || prueba[0][i]=='3' || prueba[0][i]=='4' || prueba[0][i]=='5' ||<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; prueba[0][i]=='6' || prueba[0][i]=='7' || prueba[0][i]=='8' || prueba[0][i]=='9')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;El string comienza en posicion %i\n&quot;,i);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; l=i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (k=i; k&lt;j; k++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; m=k;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (prueba[0][k]=='\0')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;El string termina en posicion %i\n&quot;,k);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k=j;&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i=j;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n=m-l;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int numero[n];&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;Variable 'numero' tiene %i espacios\n&quot;,n+1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (j=l;j&lt;(m+1);j++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numero[i]=prueba[0][j];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /*for (i=0;i&lt;(n+1);i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%c&quot;,numero[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
/*-------------------------------------------------*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*TTS para numero*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; switch(n+1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; <br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /* Ticket de 5 digitos */<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 5:<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (numero[0]=='1')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;prueba\n&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; UnidadMil(numero[1]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; }</pre><br />
 <pre style="margin:20px; line-height:13px">void UnidadMil(int unidad)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; switch (unidad){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case '3':<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; StreamFile(&quot;trece&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; StreamFile(&quot;mil&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
}<br />
void StreamFile(char *audio)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char line [80];<br />
&nbsp; &nbsp; &nbsp; &nbsp; setlinebuf(stdout);<br />
&nbsp; &nbsp; &nbsp; &nbsp; setlinebuf(stderr);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;STREAM FILE %s #&quot;&quot;\n&quot;, audio); <br />
&nbsp; &nbsp; &nbsp; &nbsp; fgets(line,80,stdin);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; fputs(line,stderr);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; fflush(stdin);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>ContactaCall</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241412.html</guid>
		</item>
		<item>
			<title>optimize my code</title>
			<link>http://www.daniweb.com/forums/thread241292.html</link>
			<pubDate>Wed, 25 Nov 2009 13:46:55 GMT</pubDate>
			<description><![CDATA[Hello everyone, 
Here's my code for making a dynamic array(the user inputs the size of the array). It's working fine but I think that I've not made the best code. Is there any suggestion for improvement or optimization? 
  <div class="codeblock"> <div class="spaced"> <div style="float:right;...]]></description>
			<content:encoded><![CDATA[<div>Hello everyone,<br />
Here's my code for making a dynamic array(the user inputs the size of the array). It's working fine but I think that I've not made the best code. Is there any suggestion for improvement or optimization?<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
int main(void)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int *p;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int n,i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;how many integers do u wanna enter\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;,&amp;n);<br />
&nbsp; &nbsp; &nbsp; &nbsp; p=malloc(n*sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;n;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;enter the %d element&quot;,i+1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;,p);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; p=p-n;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;n;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d\n&quot;,*(p+i));<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; free(p);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>9868</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241292.html</guid>
		</item>
		<item>
			<title>info</title>
			<link>http://www.daniweb.com/forums/thread241287.html</link>
			<pubDate>Wed, 25 Nov 2009 13:24:41 GMT</pubDate>
			<description><![CDATA[In the following c code, the num_elements is gobal. 
But if i make it as local and return , it gives strange value just before return it becomes '0' ...can anybody explain why ?  
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>In the following c code, the num_elements is gobal.<br />
But if i make it as local and return , it gives strange value just before return it becomes '0' ...can anybody explain why ? <br />
<br />
 <pre style="margin:20px; line-height:13px">int num_elements =0;<br />
//generates a psuedo-random integer between min and max<br />
int randint(int min, int max)<br />
{<br />
&nbsp; &nbsp; if (min&gt;max)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; return max+int((min-max+1)*rand()/(RAND_MAX+1.0));<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; else<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; return min+int((max-min+1)*rand()/(RAND_MAX+1.0));<br />
&nbsp; &nbsp; }<br />
} <br />
<br />
unsigned int sample(unsigned int m, unsigned int n, unsigned int *set)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; unsigned int t, i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; unsigned int j,l;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (m==0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; l=sample(m-1, n-1, set);<br />
&nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; t = randint(1,n);<br />
&nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(num_elements !=0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  for (i=0; i &lt;num_elements; i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if ( t == set[i])<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* add t to s */<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  set[num_elements] = t;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* add to n to s; */<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  set[num_elements] = n;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; } <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; set[num_elements] = t;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; j= num_elements++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&quot;, num_elements);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return j;<br />
}<br />
<br />
int _tmain(int argc, _TCHAR* argv[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; unsigned int a = 2, b=4;<br />
&nbsp; &nbsp; &nbsp; &nbsp; unsigned int set[10];<br />
&nbsp; &nbsp; &nbsp; &nbsp; num_elements=0;<br />
&nbsp; &nbsp; sample(a, b, set);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&quot;, num_elements);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; Sleep(10000);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>pdk123</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241287.html</guid>
		</item>
		<item>
			<title>Need help starting dice problem</title>
			<link>http://www.daniweb.com/forums/thread241163.html</link>
			<pubDate>Wed, 25 Nov 2009 03:56:27 GMT</pubDate>
			<description>Hey everyone, I am stuck on the last function of my problem, could someone help me get started by helping me on the first part of function? 
 
Question: 
I need to write a random function to get 2 numbers from 1-6, and needs to be in a loop 25 times or until both numbers are 6 
 
Thanks For Any...</description>
			<content:encoded><![CDATA[<div>Hey everyone, I am stuck on the last function of my problem, could someone help me get started by helping me on the first part of function?<br />
<br />
Question:<br />
I need to write a random function to get 2 numbers from 1-6, and needs to be in a loop 25 times or until both numbers are 6<br />
<br />
Thanks For Any Help.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>applesplz</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241163.html</guid>
		</item>
		<item>
			<title>need help with searching function for string</title>
			<link>http://www.daniweb.com/forums/thread241098.html</link>
			<pubDate>Tue, 24 Nov 2009 20:52:17 GMT</pubDate>
			<description>Hi, I am trying to search for a word I have entered into a list.  I could list all entries  so far.  But I am having a hard time figuring out a function that can search for a particular word on the list.  Below are the codes. I commented out different functions I have tried.  Thank you!    
    ...</description>
			<content:encoded><![CDATA[<div>Hi, I am trying to search for a word I have entered into a list.  I could list all entries  so far.  But I am having a hard time figuring out a function that can search for a particular word on the list.  Below are the codes. I commented out different functions I have tried.  Thank you!   <br />
    <pre style="margin:20px; line-height:13px">boolean searchWord (VOCAB V[])<br />
<br />
&nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp;  int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp;  char target[LENGTH];<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;\nEnter the Word you want to search: &quot;); <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  fflush (stdin);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  gets (target);&nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for ( i=0; i&lt;SIZE; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // if ( target == V[i].Word )<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  //if ( strcmp( target, V[i].Word ) == 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (strncmp (V[i].Word,&quot;target&quot;) == 0)<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  return 1;&nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp;  }</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>student1t</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241098.html</guid>
		</item>
		<item>
			<title>Assignment in C help ( factorial)</title>
			<link>http://www.daniweb.com/forums/thread241094.html</link>
			<pubDate>Tue, 24 Nov 2009 20:27:19 GMT</pubDate>
			<description><![CDATA[Hi i'm having some trouble getting my head around this assignment... 
which is :  
Design, write and test a program to print a table of factorials. The program should read in two values: a maximum factorial value and a minimum factorial value.  
It must then print a table, as illustrated below,...]]></description>
			<content:encoded><![CDATA[<div>Hi i'm having some trouble getting my head around this assignment...<br />
which is : <br />
Design, write and test a program to print a table of factorials. The program should read in two values: a maximum factorial value and a minimum factorial value. <br />
It must then print a table, as illustrated below, with one column for the factorial number, one column for the factorial expression and a third column showing the result. The program must produce this table from maximum factorial value to the minimum factorial value; e.g. if the maximum factorial value is 5 and the minimum factorial value is 3 the program produces a table like the following:  <br />
<br />
<br />
 <pre style="margin:20px; line-height:13px">Factorial value&nbsp; &nbsp; &nbsp; &nbsp; Factorial Expression&nbsp; &nbsp; &nbsp; &nbsp;  Result<br />
-----------------------------------------------------------------------------------<br />
5!&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  5*4*3*2*1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 120<br />
4!&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 4*3*2*1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 24<br />
3!&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 3*2*1&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  6<br />
<br />
------------------------------------------------------------------------------------</pre><br />
<br />
The program must repeatedly ask the user to input data and print a table of factorials, as illustrated above, until the user decides to exit the program. <br />
<br />
<br />
so far i have been succesfull in creating the table reading in a maximum and min factorial and creating a list downwards to the left<br />
<br />
what im finding hard is placing the 5*4*3 etc into the middle column<br />
<br />
here is my code so far<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include&lt;conio.h&gt;<br />
<br />
void main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; // defining and initialising variables<br />
&nbsp; &nbsp; int max , factorial;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int min=0;<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; //enters a maximum factorial<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Please enter a Maximum Factorial:&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;, &amp;max);<br />
&nbsp; &nbsp; fflush(stdin);<br />
&nbsp; &nbsp; //enters a minimum factorial<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\nPlease enter a Minimum factorial:&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;, &amp;min);&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; fflush(stdin);<br />
&nbsp; &nbsp; //handles an input error<br />
&nbsp; &nbsp; if (max&gt;min)<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;----------------------------------------------------------------------&quot;);<br />
&nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;\nyou have entered an invalid number\n&quot;);<br />
&nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\nFactorial Value&nbsp; &nbsp; &nbsp; &nbsp; Factorial expression&nbsp; &nbsp; &nbsp; &nbsp; Factorial Result&quot;);<br />
&nbsp; &nbsp; printf(&quot;\n----------------------------------------------------------------------&quot;);<br />
&nbsp; &nbsp; //creating a list from max to min factorials<br />
&nbsp; &nbsp; &nbsp; &nbsp; factorial=max;<br />
&nbsp; &nbsp; &nbsp; &nbsp; while ( factorial&gt;=min){<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n%d!&quot; ,max);<br />
&nbsp; &nbsp; &nbsp; &nbsp; max=max-1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; factorial=factorial-1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
getch();<br />
}</pre><br />
if anyone could help it would be hugely appreciated</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>John-5-</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241094.html</guid>
		</item>
		<item>
			<title>How to get Motherboard information from C/C++ under Windows ?</title>
			<link>http://www.daniweb.com/forums/thread241046.html</link>
			<pubDate>Tue, 24 Nov 2009 16:09:42 GMT</pubDate>
			<description>Hi! 
 
I develop the app, that must be binded to hardware-specific information. 
This is a part of license protection scenario. 
The serial number of motherboard must be obtained. 
 
How to do it under Windows ?</description>
			<content:encoded><![CDATA[<div>Hi!<br />
<br />
I develop the app, that must be binded to hardware-specific information.<br />
This is a part of license protection scenario.<br />
The serial number of motherboard must be obtained.<br />
<br />
How to do it under Windows ?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>AntonAL</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241046.html</guid>
		</item>
		<item>
			<title>Help with two programmes</title>
			<link>http://www.daniweb.com/forums/thread241011.html</link>
			<pubDate>Tue, 24 Nov 2009 14:14:20 GMT</pubDate>
			<description><![CDATA[Hi! 
I'm new to programming and have difficulties in working out the following two examples: 
 
Image: http://www.pictureupload.de/originals/pictures/241109145734_Unbenannt.JPG  
 
hope someone can help me]]></description>
			<content:encoded><![CDATA[<div>Hi!<br />
I'm new to programming and have difficulties in working out the following two examples:<br />
<br />
<img src="http://www.pictureupload.de/originals/pictures/241109145734_Unbenannt.JPG" border="0" alt="" /><br />
<br />
hope someone can help me</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>SSc</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread241011.html</guid>
		</item>
		<item>
			<title>usage of new keywords in c99</title>
			<link>http://www.daniweb.com/forums/thread240998.html</link>
			<pubDate>Tue, 24 Nov 2009 13:36:06 GMT</pubDate>
			<description><![CDATA[hi , 
i have read that c99 introduced: 
inline,_Bool,restrict,_Complex,_Imaginary 
 
i have used _Bool here but do no how to use remaining all 
please any one used the above can help me. 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>hi ,<br />
i have read that c99 introduced:<br />
inline,_Bool,restrict,_Complex,_Imaginary<br />
<br />
i have used _Bool here but do no how to use remaining all<br />
please any one used the above can help me.<br />
 <pre style="margin:20px; line-height:13px">int main()<br />
{<br />
&nbsp; &nbsp; _Bool b;<br />
&nbsp; &nbsp; &nbsp; b=true;// giving error&nbsp; true undeclared ,cant i use that way <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  // with out using enums.<br />
&nbsp; &nbsp; &nbsp;  b =1;<br />
&nbsp; &nbsp; &nbsp;  if ( b )<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf (&quot; ok\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;No\n&quot;);<br />
return 0;<br />
}</pre><br />
Thanks,<br />
Danian.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Iam3R</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240998.html</guid>
		</item>
		<item>
			<title>Need help getting started.</title>
			<link>http://www.daniweb.com/forums/thread240884.html</link>
			<pubDate>Tue, 24 Nov 2009 04:05:43 GMT</pubDate>
			<description><![CDATA[So I have this project to program an "auto parts management" C program.  Basically I need to be able to add and delete lines of text from a text file.  Also, I need to be able to edit lines of text. Lines of text are in the format: 
 
PART NAME : OWNER : STATUS : SYSTEM DATE : CO NAME 
 
Although I...]]></description>
			<content:encoded><![CDATA[<div>So I have this project to program an &quot;auto parts management&quot; C program.  Basically I need to be able to add and delete lines of text from a text file.  Also, I need to be able to edit lines of text. Lines of text are in the format:<br />
<br />
PART NAME : OWNER : STATUS : SYSTEM DATE : CO NAME<br />
<br />
Although I don't know much about them, structures would seem like they would be useful. I think in my case it would look like this:<br />
<br />
 <pre style="margin:20px; line-height:13px">struct parts<br />
{<br />
&nbsp; char pname [PNAME_LEN+1];<br />
&nbsp; char owner [OWNER_LEN+1];<br />
&nbsp; char status [3];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //toggles between in/out<br />
&nbsp; char date [10];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; // MM/DD/YYYY format.<br />
&nbsp; char oname [ONAME_LEN+1];<br />
} part1, part2, part3;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  //etc... I assume I need a loop<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //to increment part.</pre><br />
To add a part, the program will prompt the user for a pname and an owner.  So once I have those two things captured in variables, I need to initialize part1 so it contains &quot;pname:owner:in&quot; with the date and co name left blank.  Will this work?<br />
<br />
 <pre style="margin:20px; line-height:13px">struct parts part1;<br />
strcpy(part1.pname, pname);<br />
strcpy(part1.oname, owner);<br />
strcpy(part1.status, &quot;in&quot;);</pre><br />
How would I then print part1 into a text file?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Mattpd</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240884.html</guid>
		</item>
		<item>
			<title>heap sort -- segmentation fault</title>
			<link>http://www.daniweb.com/forums/thread240858.html</link>
			<pubDate>Tue, 24 Nov 2009 01:59:42 GMT</pubDate>
			<description><![CDATA[I am writing a program that sorts an array of either floats or doubles -- this is specified at compile time via a command to the compiler.  I also must use void pointers.  My program compiles, but when I try to run it with floats I get a "segmentation fault" and when i try to run it with doubles I...]]></description>
			<content:encoded><![CDATA[<div>I am writing a program that sorts an array of either floats or doubles -- this is specified at compile time via a command to the compiler.  I also must use void pointers.  My program compiles, but when I try to run it with floats I get a &quot;segmentation fault&quot; and when i try to run it with doubles I get a &quot;illegal instruction&quot; error message.  Any suggestions?? Thanks in advance for your help!!<br />
<br />
Here is the main, heapSort file, and header file: (the program also contains files for insert, merge, and bubble which you will see in the main and header but I am only concerned with the heap sort file)<br />
 <pre style="margin:20px; line-height:13px">//header file<br />
<br />
#ifndef SRT_H<br />
#define SRT_H<br />
<br />
#include &lt;string.h&gt;<br />
<br />
#define MAX_BUF 256<br />
<br />
#define swap(qx,qy,sz)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
do {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
&nbsp; &nbsp; char buf[MAX_BUF];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
&nbsp; &nbsp; char *q1 = qx;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
&nbsp; &nbsp; char *q2 = qy;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
&nbsp; &nbsp; for (size_t m, ms = sz; ms &gt; 0; ms -= m, q1 += m, q2 += m) {&nbsp; &nbsp; \<br />
&nbsp; &nbsp; &nbsp; &nbsp; m = ms &lt; sizeof(buf) ? ms : sizeof(buf);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
&nbsp; &nbsp; &nbsp; &nbsp; memcpy(buf, q1, m);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  \<br />
&nbsp; &nbsp; &nbsp; &nbsp; memcpy(q1, q2, m);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \<br />
&nbsp; &nbsp; &nbsp; &nbsp; memcpy(q2, buf, m);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  \<br />
&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  \<br />
} while (0)<br />
<br />
void srtbubb(void *, size_t, size_t, int (*)(const void *, const void *));<br />
void srtheap(void *, size_t, size_t, int (*)(const void *, const void *));<br />
void srtinsr(void *, size_t, size_t, int (*)(const void *, const void *));<br />
void srtmerg(void *, size_t, size_t, int (*)(const void *, const void *));<br />
<br />
#endif /* SRT_H */<br />
<br />
//main<br />
#include &lt;limits.h&gt;<br />
#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
#include &quot;srt.h&quot;<br />
<br />
int compare(const void *, const void *);<br />
<br />
int main(int argc, char *argv[]) {<br />
<br />
&nbsp; &nbsp; int size = argc == 2 ? atoi(argv[1]) : SHRT_MAX;<br />
<br />
&nbsp; &nbsp; TYPE *a = calloc(size, sizeof(TYPE));<br />
<br />
#ifdef RAND<br />
&nbsp; &nbsp; for (int i = 0; i &lt; size; ++i) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; a[i] = (TYPE)rand() / RAND_MAX;<br />
&nbsp; &nbsp; }<br />
#else<br />
&nbsp; &nbsp; for (int i = 0; i &lt; size; ++i) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; a[i] = i;<br />
&nbsp; &nbsp; }<br />
#endif<br />
<br />
#if defined BUBB<br />
&nbsp; &nbsp; srtbubb(a, size, sizeof(TYPE), compare);<br />
#elif defined HEAP<br />
&nbsp; &nbsp; srtheap(a, size, sizeof(TYPE), compare);<br />
#elif defined INSR<br />
&nbsp; &nbsp; srtinsr(a, size, sizeof(TYPE), compare);<br />
#elif defined MERG<br />
&nbsp; &nbsp; srtmerg(a, size, sizeof(TYPE), compare);<br />
#else<br />
&nbsp; &nbsp; qsort(a, size, sizeof(TYPE), compare);<br />
#endif<br />
<br />
#ifdef PRNT<br />
&nbsp; &nbsp; for (int i = 0; i &lt; size; ++i) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%f\n&quot;, a[i]);<br />
&nbsp; &nbsp; }<br />
#else<br />
&nbsp; &nbsp; for (int i = 0; i &lt; size - 1; ++i) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (a[i] &gt; a[i + 1]) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;fail\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; goto end;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; printf(&quot;pass\n&quot;);<br />
#endif<br />
<br />
end:<br />
<br />
&nbsp; &nbsp; free(a);<br />
<br />
&nbsp; &nbsp; return 0;<br />
}<br />
<br />
int compare(const void *p1, const void *p2) {<br />
<br />
&nbsp; &nbsp; if (*(TYPE *)p1 &lt; *(TYPE *)p2) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return -5;<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; else if (*(TYPE *)p1 &gt; *(TYPE *)p2) {<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return +5;<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; return 0;<br />
}<br />
<br />
//heap sort file<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;string.h&gt;<br />
#include &lt;stdbool.h&gt;<br />
#include &lt;stddef.h&gt;<br />
#include &quot;srt.h&quot;<br />
<br />
void heapify (void *, size_t, size_t);<br />
void siftdown(void *, char *, char *, size_t, size_t);<br />
void srtheap(void *base, size_t nelem, size_t size, int (*compar)(const void *, const void *)) {<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  heapify(base, nelem, size);&nbsp; &nbsp; <br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  char *pEnd = (char *)base + ((nelem - 1) * size);<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  while (pEnd &gt; 0){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  swap(pEnd, base, size);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  pEnd -= size;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  siftdown(base, 0, pEnd, size, nelem);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp;  }<br />
}<br />
<br />
void heapify(void *pBase, size_t nelem, size_t size){<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  char *pStart = (char *)pBase + (((nelem-2)/2) * size);&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  char *pEnd = (char *)pBase + ((nelem - 1) * size);<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  while (pStart &gt;= 0){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  pEnd -= size;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  siftdown(pBase, pStart, pEnd, size, nelem);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  pStart -= size;<br />
&nbsp; &nbsp;  }<br />
&nbsp; &nbsp;  return;<br />
}<br />
<br />
void siftdown(void *pBase, char * pStart, char * pEnd, size_t size, size_t nelem){<br />
<br />
&nbsp; &nbsp;  char *pRoot;<br />
&nbsp; &nbsp;  pRoot = pStart;<br />
&nbsp; &nbsp;  size_t l = (nelem / 2);<br />
&nbsp; &nbsp;  size_t r = (nelem - 1);<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  while ((pRoot + (size * l)) &lt;= pEnd){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  char *pChild;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  pChild = (pRoot + (size * l));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  if (((pChild + size) &lt;= pEnd) &amp;&amp; (pChild &lt; (pChild + size)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pChild += size;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  if (pRoot &lt; pChild){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; swap(pRoot, pChild, size);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pRoot = pChild;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  return;<br />
&nbsp; &nbsp;  }<br />
&nbsp; &nbsp;  return;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>klackey19</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240858.html</guid>
		</item>
		<item>
			<title>Pointer arithmetic question</title>
			<link>http://www.daniweb.com/forums/thread240854.html</link>
			<pubDate>Tue, 24 Nov 2009 01:33:06 GMT</pubDate>
			<description><![CDATA[Hey everyone, 
 
I'm coding a program in C and have a pointer called pRoot.  I need to do (2 * pRoot) .. but the compiler says I cannot.  Is there some legal way of implementing this pointer arithmetic? 
 
Thanks in advance for your help!]]></description>
			<content:encoded><![CDATA[<div>Hey everyone,<br />
<br />
I'm coding a program in C and have a pointer called pRoot.  I need to do (2 * pRoot) .. but the compiler says I cannot.  Is there some legal way of implementing this pointer arithmetic?<br />
<br />
Thanks in advance for your help!</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>klackey19</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240854.html</guid>
		</item>
		<item>
			<title>buffer problem or undefined behaviour</title>
			<link>http://www.daniweb.com/forums/thread240846.html</link>
			<pubDate>Tue, 24 Nov 2009 01:20:42 GMT</pubDate>
			<description><![CDATA[<div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C Syntax</strong> (<a...]]></description>
			<content:encoded><![CDATA[<div> <pre style="margin:20px; line-height:13px">enum fivenums {Z,O,T,TH,F,FI}<br />
int main()<br />
{<br />
char ch;<br />
int num;<br />
do{<br />
scanf(&quot;%d&quot;,&amp;num);<br />
switch(num)<br />
{<br />
case Z:<br />
printf(&quot;ZERO\n&quot;);<br />
break;<br />
case O:<br />
printf(&quot;ONE\n&quot;);<br />
break;<br />
case T:<br />
printf(&quot;TWO\n&quot;);<br />
break;<br />
case TH:<br />
printf(&quot;THREE\n&quot;);<br />
break;<br />
case F:<br />
printf(&quot;FOUR\n&quot;);<br />
break;<br />
case FI:<br />
printf(&quot;FIVE\n&quot;);<br />
break;<br />
<br />
default :<br />
printf(&quot;Invalid\n&quot;);<br />
break;<br />
}<br />
getchar();// to eat '\n' terminator so that it waits for below <br />
}<br />
while ((ch =getchar())=='\n');<br />
return 0;<br />
}</pre><br />
in the above program if i input a number between 0 -3 its working fine.<br />
but if the input is any alphabet     i am getting a different out put;<br />
<br />
for example:<br />
my input is<br />
1<br />
o/p: ONE<br />
2<br />
o/p: TWO<br />
and if its <br />
a O/P is:<br />
TWO<br />
if i give a its giving the previously read input as out put <br />
i.e 2.<br />
and for any other alphabets also its giving the same o/p.<br />
why is it giving the previous one.<br />
when its already read from the buffer.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Iam3R</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240846.html</guid>
		</item>
		<item>
			<title>24 hour clock</title>
			<link>http://www.daniweb.com/forums/thread240774.html</link>
			<pubDate>Mon, 23 Nov 2009 19:07:40 GMT</pubDate>
			<description>Hey guys, 
 
i am writing a couple of programs but I have some problem with the basic one... 
 
can you please provide me with a 24 hour clock which has hour, minute and second? also it should have the ability to set the time.. 
 
your help is highly appreciated...it is somehow urgent as i need to...</description>
			<content:encoded><![CDATA[<div>Hey guys,<br />
<br />
i am writing a couple of programs but I have some problem with the basic one...<br />
<br />
can you please provide me with a 24 hour clock which has hour, minute and second? also it should have the ability to set the time..<br />
<br />
your help is highly appreciated...it is somehow urgent as i need to do the other programs based on this....</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>amr123</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240774.html</guid>
		</item>
		<item>
			<title>building my own primitive shell</title>
			<link>http://www.daniweb.com/forums/thread240754.html</link>
			<pubDate>Mon, 23 Nov 2009 17:21:18 GMT</pubDate>
			<description><![CDATA[Hi all, 
 
I'm helping my girl out with her hw, (/me not knowing C at all, but someone has to help, right?) 
I am supposed to read user input, and then try to execute a given command plus the arguments in every given $PATH.  
 
I managed it all, but I get puzzled by the execv function, which I am...]]></description>
			<content:encoded><![CDATA[<div>Hi all,<br />
<br />
I'm helping my girl out with her hw, (/me not knowing C at all, but someone has to help, right?)<br />
I am supposed to read user input, and then try to execute a given command plus the arguments in every given $PATH. <br />
<br />
I managed it all, but I get puzzled by the execv function, which I am supposed to be using, it doesn't  produce any stdio, and I can't seem to find a way to make it work<br />
<br />
a basic command <br />
 <pre style="margin:20px; line-height:13px">execv (&quot;/bin/touch&quot;, &quot;/tmp/test123&quot;, NULL);</pre>doesn't do anything, neither do I see an exit code. <br />
How do I use it?<br />
<br />
Here's what I've got so far:<br />
 <pre style="margin:20px; line-height:13px">void get_path_exec(char cmd[50])<br />
{<br />
&nbsp; &nbsp; char command[50] = {0} ; //full command with path included<br />
&nbsp; &nbsp; char *tempcmd = NULL;<br />
&nbsp; &nbsp; char *result = NULL; //path iterator<br />
&nbsp; &nbsp; char *com[] = {0}; //command with args, no path<br />
&nbsp; &nbsp; char *arg = NULL; //list of arguments, path and command excluded<br />
&nbsp; &nbsp; char delims[] = &quot;:&quot;; //path iteration delimiter<br />
&nbsp; &nbsp; char delims1[] = &quot; &quot;; //<br />
&nbsp; &nbsp; char * path; //variable to hold the full path delimited by ':'<br />
&nbsp; &nbsp; int pid, status; //process flow control<br />
&nbsp; &nbsp; int argcount = 0; //argumetn counter, where 0 is the command<br />
&nbsp;  <br />
&nbsp; &nbsp; tempcmd=cmd; //assign to temp variable, so strtok doesn't ruin cmd<br />
&nbsp; &nbsp; path=getenv(&quot;PATH&quot;);<br />
&nbsp; &nbsp; if (path != NULL)<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Path is %s \n&quot;, path);<br />
&nbsp; &nbsp; else exit(1);&nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; arg = strtok( tempcmd, delims1 ); <br />
&nbsp; &nbsp; com[0] = arg; //place the command into com[0]<br />
&nbsp; &nbsp; while( arg )<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; argcount++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; arg = strtok(NULL,delims1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; com[argcount] = arg;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;arg is %s \n&quot;, arg);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; argcount++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; com[argcount]=NULL; //last value in args should be NULL, right?<br />
<br />
&nbsp; &nbsp; result = strtok( path, delims ); <br />
&nbsp; &nbsp; while( result ) <br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp;  strcpy(command, &quot;&quot;);<br />
&nbsp; &nbsp; &nbsp;  strcat(command, result);<br />
&nbsp; &nbsp; &nbsp;  strcat(command, &quot;/&quot;);<br />
&nbsp; &nbsp; &nbsp;  strcat(command,cmd);<br />
&nbsp; &nbsp; &nbsp;  strcat(command,&quot;\0&quot;); //gather all parts of full path'd command - path, &quot;/&quot; and cmdname<br />
//&nbsp; &nbsp; &nbsp;  printf(&quot;full command: %s \n\n&quot;, command);<br />
&nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp;  if (( pid = fork()) == 0 ) //create a new process<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; execv(command, com);<br />
//below is a point I don't get<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Something happened here, but what? %s \n Status is %d \n\n&quot;, result, status);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  wait(&amp;status);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;Something else happened here %s \n Status after wait is %d&quot;, command, status);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  if (status != 0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;And something happened again? \n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; result = strtok( NULL, delims );<br />
&nbsp; &nbsp; } <br />
}</pre><br />
The entire pid-fork-&amp;status structure is just too vague for me, can anyone explain what happens on every step of the way? <br />
<br />
Using execl, by the way, worked for me, but I have to use execv.<br />
<br />
<br />
Thanks</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>DimaYasny</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240754.html</guid>
		</item>
		<item>
			<title>Structures in functions.</title>
			<link>http://www.daniweb.com/forums/thread240747.html</link>
			<pubDate>Mon, 23 Nov 2009 16:46:27 GMT</pubDate>
			<description><![CDATA[I am trying to write a function to add two arrays. The catch is that the arrays have to parts of a structure. So here is what I have so far: 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>I am trying to write a function to add two arrays. The catch is that the arrays have to parts of a structure. So here is what I have so far:<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
<br />
struct poly {<br />
&nbsp; &nbsp; &nbsp; &nbsp; array1[];<br />
&nbsp; &nbsp; &nbsp; &nbsp; array2[];<br />
&nbsp; &nbsp; &nbsp; &nbsp; length;<br />
&nbsp; &nbsp; &nbsp; &nbsp; };<br />
<br />
void polyadd(int array1[],int array2[],int length) {&nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct poly p;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;length;i++) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p.array1[i]=array1[i] + array2[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot; %d &quot;, p.array1[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
int main(void) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct poly name1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; name1.length = 4;<br />
&nbsp; &nbsp; &nbsp; &nbsp; name1.array1[4] = {3,0,7};<br />
&nbsp; &nbsp; &nbsp; &nbsp; name1.array2[4] = {0,15,0,-4};<br />
&nbsp; &nbsp; &nbsp; &nbsp; polyadd(name1.array1,name1.array2,name1.length);<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre><br />
And here are the error messages I am getting:<br />
<br />
structadd.c:4: error: expected specifier-qualifier-list before âarray1â<br />
structadd.c: In function âpolyaddâ:<br />
structadd.c:13: error: âstruct polyâ has no member named âarray1â<br />
structadd.c:14: error: âstruct polyâ has no member named âarray1â<br />
structadd.c: In function âmainâ:<br />
structadd.c:20: error: âstruct polyâ has no member named âlengthâ<br />
structadd.c:21: error: âstruct polyâ has no member named âarray1â<br />
structadd.c:21: error: expected expression before â{â token<br />
structadd.c:22: error: âstruct polyâ has no member named âarray2â<br />
structadd.c:22: error: expected expression before â{â token<br />
structadd.c:23: error: âstruct polyâ has no member named âarray1â<br />
structadd.c:23: error: âstruct polyâ has no member named âarray2â<br />
structadd.c:23: error: âstruct polyâ has no member named âlengthâ</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Soileau</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240747.html</guid>
		</item>
		<item>
			<title>Passing an array of structs by reference?</title>
			<link>http://www.daniweb.com/forums/thread240740.html</link>
			<pubDate>Mon, 23 Nov 2009 16:10:28 GMT</pubDate>
			<description><![CDATA[Hi, i'm just mixing file handling and struct types and pointers to learn, but i'm a little stuck on this. 
I might be doing something awfull i can tell, sorry for that. Can anyone help? What's the best way to pass 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right;...]]></description>
			<content:encoded><![CDATA[<div>Hi, i'm just mixing file handling and struct types and pointers to learn, but i'm a little stuck on this.<br />
I might be doing something awfull i can tell, sorry for that. Can anyone help? What's the best way to pass<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;ctype.h&gt;<br />
#include &lt;string.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
<br />
struct persona {<br />
&nbsp; &nbsp; char nombre[15];<br />
&nbsp; &nbsp; char apellido[15];<br />
&nbsp; &nbsp; unsigned edad;<br />
};<br />
<br />
int edadMedia(struct persona *);<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; char *filename = &quot;C:\\Usuarios\\Administrador\\Escritorio\\C\\test.txt&quot;;<br />
&nbsp; &nbsp; printf(&quot;Accediendo a %s:\n&quot;, filename);<br />
&nbsp; &nbsp; FILE *file = fopen(filename, &quot;r&quot;);<br />
<br />
&nbsp; &nbsp; struct persona nombres[10];<br />
&nbsp; &nbsp; int counter = 0, contador = 0;<br />
&nbsp; &nbsp; char *linea;<br />
&nbsp; &nbsp; linea = malloc(15 * sizeof(char));<br />
<br />
&nbsp; &nbsp; while((fgets(linea, 15, file)) &amp;&amp; *linea != EOF)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Reading line %i -&gt; %s&quot;, counter, linea);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(linea[0] == '#') continue;<br />
&nbsp; &nbsp; &nbsp; &nbsp; switch (counter)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 0:<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(nombres[contador].nombre, linea);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; counter++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 1:<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(nombres[contador].apellido, linea);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; counter++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 2:<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; nombres[contador].edad = (unsigned int) atoi(linea);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; counter = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; contador++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; printf(&quot;\n\n\t[i] Detectados %i miembros!\n&quot;, contador);<br />
&nbsp; &nbsp; printf(&quot;\t[i] Edad media %i años&quot;, edadMedia(nombres));<br />
&nbsp; &nbsp; return 0;<br />
}<br />
<br />
int edadMedia(struct persona * nombres) { //code still to go here }</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>neithan</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240740.html</guid>
		</item>
		<item>
			<title>Multiple simultaneous file open in C</title>
			<link>http://www.daniweb.com/forums/thread240699.html</link>
			<pubDate>Mon, 23 Nov 2009 13:10:48 GMT</pubDate>
			<description>I have an arbitrary number of files whose names I will know and I want to open them for reading.  The important point is that I do not want to open them sequentially using a single file pointer.  I need to have them all open at the same time.  This suggests using and an  array of file pointers,...</description>
			<content:encoded><![CDATA[<div>I have an arbitrary number of files whose names I will know and I want to open them for reading.  The important point is that I do not want to open them sequentially using a single file pointer.  I need to have them all open at the same time.  This suggests using and an  array of file pointers, where this is declared to be of dimension N, where N is the maximum number of files I can have open.<br />
<br />
A quick trawl of the web has not brought anything up and it's not in my textbooks.  Being a relatively infrequent C-programmer, I'm not at all sure about setting up and using arrays of file pointers.  What is the declaration syntax and how is it used?  (Or is there another/better way to do what I want?)</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>SimonLeefe</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240699.html</guid>
		</item>
		<item>
			<title>Using pcap, dirent.h and error C2085, C2061</title>
			<link>http://www.daniweb.com/forums/thread240649.html</link>
			<pubDate>Mon, 23 Nov 2009 09:31:45 GMT</pubDate>
			<description><![CDATA[Hi all, 
 
I'm new to using Visual Studio. I'm currently using VS .NET 2003 on Vista, and I'm trying to port a program from Linux to Windows. 
 
The program uses the pcap library. I have installed WinPcap 4.0.2 and downloaded the Developer's Pack WpdPack_4_0_2. However, I have no idea what to do...]]></description>
			<content:encoded><![CDATA[<div>Hi all,<br />
<br />
I'm new to using Visual Studio. I'm currently using VS .NET 2003 on Vista, and I'm trying to port a program from Linux to Windows.<br />
<br />
The program uses the pcap library. I have installed WinPcap 4.0.2 and downloaded the Developer's Pack WpdPack_4_0_2. However, I have no idea what to do with the developer's pack, i.e. what do I do with the pcap.h and other header files/libraries so my program can use the pcap functions.<br />
<br />
Also, one of the errors I've gotten was that the file dirent.h cannot<br />
be found. Is there some way to workaround this problem, i.e. some<br />
library that I can download and use so I don't have to change my code? If not, what are the alternatives?<br />
<br />
Lastly, I seem to get a lot of syntax errors. The program was able to<br />
compile and run without errors in Linux. One of these errors are<br />
&quot;error C2085: '&lt;function name&gt;': not in formal parameter list.&quot; These errors occur in the header file which is in the following format:<br />
<br />
 <pre style="margin:20px; line-height:13px">#ifndef HEADER_H<br />
#define HEADER_H<br />
<br />
/* Bunch of #include and #define statements */<br />
/* Struct declarations */<br />
<br />
/* Here's where the errors are */<br />
static void *Function1(int n);<br />
int Function2(ABC *x);&nbsp; //ABC is a self-defined structure declared in<br />
this header file<br />
ABC *Function3(void *a);<br />
static inline void Function4(unsigned char *c, unsigned char *d, int<br />
e);<br />
<br />
/* There is also a C2061: syntax error: identifier 'inline' for the<br />
following line */<br />
inline int Function5(ABC *x, unsigned char *f, int g);<br />
<br />
#endif</pre><br />
Please advise.<br />
<br />
Thank you.<br />
<br />
Regards,<br />
Rayne</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>hjazz</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240649.html</guid>
		</item>
		<item>
			<title>Emulating GREP and SED with C?</title>
			<link>http://www.daniweb.com/forums/thread240614.html</link>
			<pubDate>Mon, 23 Nov 2009 05:53:39 GMT</pubDate>
			<description>I have written some bash shell scripts, using grep and sed.  Are there any functions in C that do something similar to grep and mainly sed?  I need to be able to edit and delete individual lines of text in an external txt file, based on user input.</description>
			<content:encoded><![CDATA[<div>I have written some bash shell scripts, using grep and sed.  Are there any functions in C that do something similar to grep and mainly sed?  I need to be able to edit and delete individual lines of text in an external txt file, based on user input.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Mattpd</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240614.html</guid>
		</item>
		<item>
			<title>IPv6 Client Server Problem</title>
			<link>http://www.daniweb.com/forums/thread240525.html</link>
			<pubDate>Sun, 22 Nov 2009 23:09:53 GMT</pubDate>
			<description><![CDATA[Hi, 
 
I am trying to develop a small IPv6 application in C. I am stuck at server side. GCC issues the error while call to ACCEPT function "socket function on non-socket". Can anyone help me? 
 
1. Client Code 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right;...]]></description>
			<content:encoded><![CDATA[<div>Hi,<br />
<br />
I am trying to develop a small IPv6 application in C. I am stuck at server side. GCC issues the error while call to ACCEPT function &quot;socket function on non-socket&quot;. Can anyone help me?<br />
<br />
1. Client Code<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &quot;shahab.h&quot;<br />
<br />
<br />
<br />
int main(int argc, char **argv){<br />
<br />
&nbsp;  int connectSocket;<br />
&nbsp;  int numberOfBytes;<br />
&nbsp;  char recvData[MAX_SIZE];<br />
&nbsp;  int yes=1;<br />
<br />
&nbsp;  struct sockaddr_in6 serverAddress;<br />
&nbsp;  <br />
&nbsp;  if(argc!=2){<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp;  perror(&quot;Command Line Arguments&quot;);<br />
&nbsp; &nbsp;  exit(1);<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; if((connectSocket=socket(AF_INET6,SOCK_STREAM,0))&lt;0){<br />
<br />
&nbsp; &nbsp; &nbsp; perror(&quot;socket error&quot;);<br />
&nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; bzero(&amp;serverAddress, sizeof(serverAddress));<br />
<br />
&nbsp; &nbsp; serverAddress.sin6_family=AF_INET6;<br />
&nbsp; &nbsp; serverAddress.sin6_port=htons(SERVER_A_PORT);<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; if(inet_pton(AF_INET6,argv[1],&amp;serverAddress.sin6_addr)&lt;=0){<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;Server Address&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; if(connect(connectSocket,(struct sockaddr*)&amp;serverAddress,sizeof(serverAddress))&lt;0){<br />
<br />
&nbsp; &nbsp; &nbsp; perror(&quot;connect error&quot;);<br />
&nbsp; &nbsp; &nbsp; exit(1);<br />
&nbsp;  }<br />
<br />
&nbsp; for(;;){<br />
<br />
&nbsp; &nbsp; numberOfBytes=read(connectSocket,recvData,MAX_SIZE);<br />
<br />
&nbsp; &nbsp; if(numberOfBytes&lt;0){<br />
<br />
&nbsp; &nbsp; perror(&quot;Recv Error&quot;);<br />
&nbsp; &nbsp; exit(1);<br />
<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; recvData[numberOfBytes]='\0';<br />
<br />
&nbsp; &nbsp; printf(&quot;Received : %s\n&quot;,recvData);<br />
<br />
<br />
&nbsp; }<br />
<br />
<br />
<br />
&nbsp; close(connectSocket);<br />
<br />
<br />
&nbsp; printf(&quot;I am in IPv6 Client\n&quot;);<br />
<br />
&nbsp; return 0;<br />
<br />
<br />
<br />
}</pre><br />
2. Server Code<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &quot;shahab.h&quot;<br />
<br />
int main(){<br />
<br />
&nbsp; int listenSocket;<br />
&nbsp; int connectSocket;<br />
&nbsp; int numberOfBytes;<br />
&nbsp; int yes=1;<br />
&nbsp; char recvData[MAX_SIZE];<br />
&nbsp; char ip6[INET6_ADDRSTRLEN];<br />
&nbsp; socklen_t sin_size;<br />
<br />
<br />
<br />
&nbsp; struct sockaddr_in6 serverAddress;<br />
&nbsp; struct sockaddr_in6 clientAddress;<br />
<br />
&nbsp; if(listenSocket=socket(AF_INET6,SOCK_STREAM,0)&lt;0){<br />
<br />
&nbsp; &nbsp; perror(&quot;Connect Problem&quot;);<br />
<br />
&nbsp; }<br />
<br />
&nbsp;/* if(setsockopt(listenSocket,SOL_SOCKET, SO_REUSEADDR, &amp;yes,sizeof(int))==-1){<br />
<br />
&nbsp; &nbsp; perror(&quot;Sock Option Problem&quot;);<br />
&nbsp; &nbsp; exit(1);<br />
&nbsp; }*/<br />
<br />
&nbsp; bzero(&amp;serverAddress,sizeof(serverAddress));<br />
<br />
&nbsp; serverAddress.sin6_family=AF_INET6;<br />
&nbsp; serverAddress.sin6_addr=in6addr_any;<br />
&nbsp; serverAddress.sin6_port=htons(SERVER_A_PORT);<br />
<br />
&nbsp; bind(listenSocket,(struct sockaddr*)&amp;serverAddress,sizeof(serverAddress));<br />
<br />
&nbsp; <br />
<br />
&nbsp; listen(listenSocket,BACKLOG);<br />
<br />
&nbsp; for(;;){<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; sin_size=sizeof serverAddress;<br />
&nbsp; &nbsp; &nbsp; &nbsp; connectSocket= accept(listenSocket, (struct sockaddr *)&amp;clientAddress, &amp;sin_size);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(connectSocket==-1){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; perror(&quot;Problem&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp;  /* inet_ntop(AF_INET6, &amp;(clientAddress.sin6_addr), ip6, INET6_ADDRSTRLEN);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;The address is: %s\n&quot;, ip6);*/<br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; send(connectSocket, &quot;Hello World from Server\n&quot;, MAX_SIZE, 0);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; close(connectSocket);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; <br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
<br />
<br />
&nbsp; printf(&quot;I am IPv6 Server\n&quot;);<br />
&nbsp; return 0;<br />
}</pre><br />
<br />
Thanks</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>shahab.burki</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240525.html</guid>
		</item>
		<item>
			<title><![CDATA[can someone help me to make long programs short I've got no Idea please help!]]></title>
			<link>http://www.daniweb.com/forums/thread240442.html</link>
			<pubDate>Sun, 22 Nov 2009 13:24:20 GMT</pubDate>
			<description><![CDATA[<div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C Syntax</strong> (<a...]]></description>
			<content:encoded><![CDATA[<div> <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
#include&lt;conio.h&gt;<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int x[5], y[5], z[5], i, d;<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;5;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Enter int%d: &quot;, i);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;, &amp;x[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]) &amp;&amp; (x[0]&gt;x[2]) &amp;&amp; (x[0]&gt;x[3]) &amp;&amp; (x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[0]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]) &amp;&amp;( x[1]&gt;x[3]) &amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]) &amp;&amp;( x[2]&gt;x[3]) &amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3])&amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]) &amp;&amp;( x[3]&gt;x[2]) &amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2])&amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1])&amp;&amp;(x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]) &amp;&amp;( x[4]&gt;x[2]) &amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2])&amp;&amp;(x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1])&amp;&amp;(x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1])&amp;&amp;(x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[2])&amp;&amp;(x[1]&gt;x[3])&amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[0]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]) &amp;&amp;( x[0]&gt;x[3]) &amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]) &amp;&amp;( x[2]&gt;x[3]) &amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3])&amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]) &amp;&amp;( x[3]&gt;x[2]) &amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2])&amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]) &amp;&amp;( x[4]&gt;x[2]) &amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[1])&amp;&amp;(x[2]&gt;x[3])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[0]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]) &amp;&amp;( x[0]&gt;x[3]) &amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3])&amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]) &amp;&amp;( x[1]&gt;x[3]) &amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3])&amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]) &amp;&amp;( x[3]&gt;x[1]) &amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]) &amp;&amp;( x[4]&gt;x[1]) &amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0])&amp;&amp;(x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0])&amp;&amp;(x[3]&gt;x[1])&amp;&amp;(x[3]&gt;x[2])&amp;&amp;(x[3]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[0]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]) &amp;&amp;( x[0]&gt;x[2]) &amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1])&amp;&amp;(x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]) &amp;&amp;( x[1]&gt;x[2]) &amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2])&amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]) &amp;&amp;( x[2]&gt;x[1]) &amp;&amp;(x[2]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[4]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[4];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0]) &amp;&amp;( x[4]&gt;x[1]) &amp;&amp;(x[4]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[4];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; else if((x[4]&gt;x[0])&amp;&amp;(x[4]&gt;x[1])&amp;&amp;(x[4]&gt;x[2])&amp;&amp;(x[4]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[0]=x[4];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]) &amp;&amp;( x[0]&gt;x[2]) &amp;&amp;(x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2])&amp;&amp;(x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1])&amp;&amp;(x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1])&amp;&amp;(x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]) &amp;&amp;( x[1]&gt;x[2]) &amp;&amp;(x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2])&amp;&amp;(x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0])&amp;&amp;(x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]) &amp;&amp;( x[2]&gt;x[1]) &amp;&amp;(x[2]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[2];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[3]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0])&amp;&amp;(x[3]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[3]&gt;x[0]) &amp;&amp;( x[3]&gt;x[1]) &amp;&amp;(x[3]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[1]=x[3];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1])&amp;&amp;(x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[0];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0])&amp;&amp;(x[1]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[2]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[2]&gt;x[0])&amp;&amp;(x[2]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[2]=x[2];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if((x[0]&gt;x[1]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if((x[1]&gt;x[0]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[3]=x[1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[4]=x[0];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n%d&nbsp; %d&nbsp; %d\n&quot;, x[0],y[4],z[0]=y[0]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&nbsp; %d&nbsp; %d\n&quot;, x[1],y[3],z[1]=y[1]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&nbsp; %d&nbsp; %d\n&quot;, x[2],y[2],z[2]=y[2]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&nbsp; %d&nbsp; %d\n&quot;, x[3],y[1],z[3]=y[3]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&nbsp; %d&nbsp; %d\n&quot;, x[4],y[0],z[4]=y[4]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n\nHighest = %d\n&quot;, y[0]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Lowest = %d\n&quot;, y[4]);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>markeen</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240442.html</guid>
		</item>
		<item>
			<title>Please help. Memory Management Error</title>
			<link>http://www.daniweb.com/forums/thread240423.html</link>
			<pubDate>Sun, 22 Nov 2009 11:35:48 GMT</pubDate>
			<description><![CDATA[/* This program returns a run time error as follows: "Your code has stopped its execution with a non-zero (failure) exit value.This is generally due to run time Exceptions like Memory Access Violation and Floating Point Exception. Please check your code for run time Exceptions and try again."...]]></description>
			<content:encoded><![CDATA[<div> <pre style="margin:20px; line-height:13px">/* This program returns a run time error as follows: &quot;Your code has stopped its execution with a non-zero (failure) exit value.This is generally due to run time Exceptions like Memory Access Violation and Floating Point Exception. Please check your code for run time Exceptions and try again.&quot; PLEASE HELP.*/<br />
<br />
#include&lt;conio.h&gt;<br />
#include&lt;stdio.h&gt;<br />
struct amicable<br />
{<br />
int **amicablePairs;<br />
int size;<br />
};<br />
struct amicable* getAmicablePairs(int startnum,int endnum);<br />
int main()<br />
{<br />
struct amicable *ami;<br />
int i,startnum,endnum;<br />
clrscr();<br />
<br />
ami=getAmicablePairs(100,2000);<br />
printf(&quot;{&quot;);<br />
for(i=0;i&lt;ami-&gt;size;i++)<br />
{<br />
printf(&quot;{%d %d}&quot;,ami-&gt;amicablePairs&#91;i&#93;&#91;0&#93;,ami-&gt;amicablePairs&#91;i&#93;&#91;1&#93;);<br />
}<br />
printf(&quot;}&quot;);<br />
getch();<br />
return 0;<br />
}<br />
<br />
<br />
struct amicable * getAmicablePairs(int startnum,int endnum)<br />
{<br />
struct amicable *amic;<br />
int i,j,divisor=0,divisor1=0,k=0,l,**p;<br />
p=malloc(15*sizeof(int*));<br />
if(p==NULL)<br />
printf(&quot;failed for p&quot;);<br />
if(startnum&gt;0&amp;&amp;endnum&gt;0&amp;&amp;startnum&lt;endnum&amp;&amp;endnum&lt;=15000)<br />
{<br />
for(i=startnum;i&lt;=endnum;i++)<br />
{<br />
for(j=1;j&lt;=i/2;j++)<br />
{<br />
if(i%j==0)<br />
divisor+=j;<br />
}<br />
if(divisor&lt;=endnum&amp;&amp;divisor&gt;i)<br />
{<br />
for(l=1;l&lt;=divisor/2;l++)<br />
{<br />
if(divisor%l==0)<br />
divisor1+=l;<br />
}<br />
if(divisor1==i)<br />
{<br />
p&#91;k&#93;=malloc(2*sizeof(int));<br />
if(p&#91;k&#93;==NULL)<br />
printf(&quot;failed for loop&quot;);<br />
p&#91;k&#93;&#91;0&#93;=i;p&#91;k&#93;&#91;1&#93;=divisor;<br />
//amic-&gt;amicablePairs&#91;k&#93;&#91;0&#93;=i;<br />
//amic-&gt;amicablePairs&#91;k&#93;&#91;1&#93;=divisor;<br />
k++;<br />
}<br />
}<br />
divisor=0;divisor1=0;<br />
}<br />
if(k==1)<br />
goto here;<br />
amic-&gt;size=k;<br />
amic-&gt;amicablePairs=p;<br />
return amic;<br />
}<br />
else<br />
here:return NULL;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator><![CDATA[Rsh>>>]]></dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240423.html</guid>
		</item>
		<item>
			<title>Need to Fix this</title>
			<link>http://www.daniweb.com/forums/thread240400.html</link>
			<pubDate>Sun, 22 Nov 2009 09:35:54 GMT</pubDate>
			<description>this program has information about customers. this program has to perform the following functions. 
- display list of all customers 
- search by name 
- search by id 
- display list of customers having credit limit above 5000 
- add new customers 
 
i am unable to compile the program. here are the...</description>
			<content:encoded><![CDATA[<div>this program has information about customers. this program has to perform the following functions.<br />
- display list of all customers<br />
- search by name<br />
- search by id<br />
- display list of customers having credit limit above 5000<br />
- add new customers<br />
<br />
i am unable to compile the program. here are the codes. can anyone fix it? <br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;conio.h&gt;<br />
#include &lt;string.h&gt;<br />
#define MAX=999<br />
int i;<br />
int id;<br />
<br />
struct customer {<br />
&nbsp;char custID[20];<br />
&nbsp;char name[50];<br />
&nbsp;char address[80];<br />
&nbsp;char tell[15];<br />
&nbsp;float credl; <br />
};<br />
int add_Name ();<br />
int menu_Display ();<br />
int get_Menu ();<br />
int get_Option ();<br />
int cust_id();<br />
&nbsp;int cust_Name();<br />
<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; menu_Display ();<br />
&nbsp; &nbsp; get_Menu ();<br />
&nbsp; &nbsp; get_Option ();<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; getch();<br />
&nbsp;return 0;<br />
&nbsp;<br />
}<br />
int menu_Display () {<br />
&nbsp; &nbsp;  int choice=0;<br />
&nbsp; &nbsp;  while (choice!=6) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  get_Menu ();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  choice = get_Option();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }}<br />
int get_Menu (){<br />
&nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; for (i=0; i&lt;1; i++) {<br />
&nbsp; &nbsp; printf (&quot;\t1. Display information of all customers\n\n&quot;);<br />
&nbsp; &nbsp; printf (&quot;\t2. Search for customer by Name\n\n&quot;);<br />
&nbsp; &nbsp; printf (&quot;\t3. Search for customer by ID\n\n&quot;);<br />
&nbsp; &nbsp; printf (&quot;\t4. Display a list of customers having credit limit above 5,000\n\n&quot;);<br />
&nbsp; &nbsp; printf (&quot;\t5. Add new customer\n\n&quot;);<br />
&nbsp; &nbsp; printf (&quot;\t6. Exit\n\n&quot;);<br />
}<br />
&nbsp; &nbsp; <br />
}<br />
int get_Option () {<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; int option;<br />
&nbsp; &nbsp; printf (&quot;Please enter your option...&quot;);<br />
&nbsp; &nbsp; scanf (&quot;%d&quot;, &amp;option);<br />
}<br />
int menu_Option (int option) {<br />
&nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; switch (option) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  case 1 : cust_Name();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  case 2 : cust_id();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  case 3 : add_Name();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  case 6 : printf(&quot;The program will now exit\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  default : printf (&quot;Sorry that does not exist&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  i=getchar();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
<br />
<br />
int add_Name () {<br />
&nbsp;int i;<br />
&nbsp;struct customer xrecord[200];<br />
&nbsp;for (i=0;i&lt;1;i++)<br />
&nbsp;{<br />
&nbsp; strcpy(xrecord[i].custID,&quot;ID00&quot;);<br />
&nbsp; //strcpy(xrecord[i].custID,(strcat(xrecord[i].custID,i));<br />
&nbsp; printf(&quot;Enter Name:&quot;);<br />
&nbsp; scanf(&quot;\n%s&quot;,&amp;(xrecord[i].name)) ;<br />
&nbsp; printf(&quot;Enter address:&quot;);<br />
&nbsp; printf (&quot;\n&quot;);<br />
&nbsp; scanf(&quot;\n%s&quot;,&amp;(xrecord[i].address));<br />
&nbsp; printf(&quot;Enter tell:&quot;);<br />
&nbsp; scanf(&quot;\n%s&quot;,&amp;(xrecord[i].tell));<br />
&nbsp; printf(&quot;Enter credl:&quot;); <br />
&nbsp; scanf(&quot;\n%f&quot;,&amp;(xrecord[i].credl));<br />
&nbsp; <br />
}<br />
&nbsp; <br />
&nbsp;}<br />
&nbsp;int cust_Name() {<br />
&nbsp; &nbsp; int match;<br />
&nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; int result;<br />
&nbsp; &nbsp; int loop=0;<br />
&nbsp; &nbsp; char name[20];<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; printf(&quot;Please enter the name which you are searching for\n&quot;);<br />
&nbsp; &nbsp; gets(name);<br />
&nbsp; &nbsp; while (match == 0 &amp;&amp; i &lt; MAX) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result= strcmp(all_names[loop].name,name);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; loop++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (loop == MAX) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf (&quot;Match not found\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i=getchar();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp;int cust_id() {<br />
&nbsp; &nbsp; int match;<br />
&nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; int result=0;<br />
&nbsp; &nbsp; int loop=0;<br />
&nbsp; &nbsp; int id;<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; printf (&quot;Please enter the id number which you are searching for\n&quot;);<br />
&nbsp; &nbsp; scanf (&quot;%d&quot;, &amp;id);<br />
&nbsp; &nbsp; while (match == 0 &amp;&amp; i&lt; MAX) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; result = strcmp (all_names[loop].id,id);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; loop++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (loop == MAX) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf (&quot;Match not found&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i = getchar();<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>nhamyl</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240400.html</guid>
		</item>
		<item>
			<title>dynamic array</title>
			<link>http://www.daniweb.com/forums/thread240385.html</link>
			<pubDate>Sun, 22 Nov 2009 06:52:18 GMT</pubDate>
			<description><![CDATA[I want to make a dynamic array. but when I view the array, I think there's something wrong with the index part. Please help. Thanks! 
 
here's my code: 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>I want to make a dynamic array. but when I view the array, I think there's something wrong with the index part. Please help. Thanks!<br />
<br />
here's my code:<br />
 <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
<br />
<br />
main(){<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; int* a;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int number;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int choice;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int index = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int head;<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; while(choice!=4){<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\tMENU\t\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;[1] add number to array\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;[2] view array\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;[3] search using linear search\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;[4] quit program\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;, &amp;choice);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; switch(choice){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 1: head = add(&amp;index, a);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 2:head = view(&amp;index,a);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //case 3:linsearch(&amp;index,array[5]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; case 4: return;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; default: printf(&quot;invalid input!!!\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
}<br />
<br />
&nbsp;int add(int* index, int* a){<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; int number;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;enter number you want to enter in the array.\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d&quot;, &amp;number);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; *a = (int) malloc (5*sizeof(int));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(i = 0; i &lt;= *index; i ++){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; a[i] = number;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return *index;<br />
}<br />
<br />
&nbsp;view(int* index, int* a){<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i; <br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(i = 0; i &lt;= *index; i++){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;index: %d, %d &quot;, *index, a[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return a[5];<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>cmsc</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240385.html</guid>
		</item>
		<item>
			<title>Scheduler</title>
			<link>http://www.daniweb.com/forums/thread240377.html</link>
			<pubDate>Sun, 22 Nov 2009 05:18:36 GMT</pubDate>
			<description>Iam currently working on the design of preemptive scheduler iln Borland C. I want to know about the use of interrupts and timers in Borland C for preempting the task. Just clue of upgrading about them is enough.</description>
			<content:encoded><![CDATA[<div>Iam currently working on the design of preemptive scheduler iln Borland C. I want to know about the use of interrupts and timers in Borland C for preempting the task. Just clue of upgrading about them is enough.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Cmad</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240377.html</guid>
		</item>
		<item>
			<title>How to color some text in Dev C</title>
			<link>http://www.daniweb.com/forums/thread240367.html</link>
			<pubDate>Sun, 22 Nov 2009 03:45:56 GMT</pubDate>
			<description><![CDATA[<div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C Syntax</strong> (<a...]]></description>
			<content:encoded><![CDATA[<div> <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
<br />
#define SIZE 31<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp;  int array[SIZE]={0};<br />
&nbsp; &nbsp;  int i,j;<br />
&nbsp; &nbsp;  int startDay=0,numDays=30;<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  printf(&quot;&nbsp; S&nbsp;  M&nbsp; &nbsp; T&nbsp; &nbsp; W&nbsp; &nbsp; TH&nbsp; &nbsp; F&nbsp; &nbsp; S\n&quot;);<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  for (i=1;i&lt;=1+ startDay*5;i++)<br />
&nbsp; &nbsp;  printf(&quot; &quot;);<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  for (i= 1; i &lt;= numDays; i++) <br />
&nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;%2d&quot;,i);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  if ((i+startDay)%7 &gt; 0)&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; printf(&quot;&nbsp;  &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  system(&quot;color 6&quot;);}<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  else&nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n &quot;);<br />
&nbsp; &nbsp;  }<br />
&nbsp; &nbsp;  startDay = (startDay + numDays)%7;<br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  <br />
&nbsp; &nbsp;  getchar();<br />
&nbsp; &nbsp;  getchar();<br />
}</pre>     <br />
I used  <pre style="margin:20px; line-height:13px">system(&quot;color &quot;);</pre> but it will only colorize my enter text...<br />
I only want to colorize the days in Sunday;<br />
<br />
I dont know how to do it...Can anyone teach me please?.,</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>DoEds</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240367.html</guid>
		</item>
		<item>
			<title>Converting long integer Into Array</title>
			<link>http://www.daniweb.com/forums/thread240276.html</link>
			<pubDate>Sat, 21 Nov 2009 17:05:11 GMT</pubDate>
			<description><![CDATA[What I am trying to accomplish here is to split a long integer apart so I can look at its first, last, and center digits. What I am currently using is this: 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>What I am trying to accomplish here is to split a long integer apart so I can look at its first, last, and center digits. What I am currently using is this:<br />
<br />
 <pre style="margin:20px; line-height:13px">int main() {<br />
&nbsp; long i, t[1024];<br />
&nbsp; <br />
&nbsp; i = 100;<br />
<br />
&nbsp; while (i &lt; 150) {<br />
&nbsp; &nbsp; t = i; // My attempt at converting the long into an array.<br />
&nbsp; &nbsp; printf(&quot;%ld\n&quot;, t[2]);<br />
&nbsp; &nbsp; i += 1;<br />
&nbsp; }</pre><br />
Any help would be appreciated!</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>dieom</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240276.html</guid>
		</item>
		<item>
			<title>FILE stream, syntax in getc</title>
			<link>http://www.daniweb.com/forums/thread240260.html</link>
			<pubDate>Sat, 21 Nov 2009 15:38:39 GMT</pubDate>
			<description><![CDATA[Hi everyone, i have this portion of code 
while(c = getc(file) != EOF) 
c is an int and file is a FILE *file = fopen(filename, "r"); 
 
The filename points to a file with 2 lines, 10 characters total. That while always makes c a value of 1 (accodring to ASCII -> start text, dunno what that mean)....]]></description>
			<content:encoded><![CDATA[<div>Hi everyone, i have this portion of code<br />
 <pre style="margin:20px; line-height:13px">while(c = getc(file) != EOF)</pre><br />
c is an int and file is a FILE *file = fopen(filename, &quot;r&quot;);<br />
<br />
The filename points to a file with 2 lines, 10 characters total. That while always makes c a value of 1 (accodring to ASCII -&gt; start text, dunno what that mean).<br />
But when i use this while:<br />
 <pre style="margin:20px; line-height:13px">while((c = getc(file)) != EOF)</pre><br />
It works perfect. I though that was equivalent...i'm missing something on basic syntax here. What's wrong in the first while?<br />
<br />
Thank you.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>neithan</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240260.html</guid>
		</item>
		<item>
			<title>char in c?</title>
			<link>http://www.daniweb.com/forums/thread240214.html</link>
			<pubDate>Sat, 21 Nov 2009 10:32:32 GMT</pubDate>
			<description><![CDATA[hi, i am new to c have to write a program to check the shape.  
I think the error is somewhere at shape= square. I know i can use printf statements but i want it in this format. Can someone help me please?  
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right;...]]></description>
			<content:encoded><![CDATA[<div>hi, i am new to c have to write a program to check the shape. <br />
I think the error is somewhere at shape= square. I know i can use printf statements but i want it in this format. Can someone help me please? <br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
int main (void)<br />
{<br />
int length,breadth;<br />
char shape;<br />
printf(&quot;Input your length: &quot;);<br />
scanf(&quot;%f&quot;, &amp;length);<br />
printf(&quot;Input your breadth: &quot;);<br />
scanf(&quot;%f&quot;, &amp;breadth);<br />
<br />
if (length=breadth)<br />
&nbsp; &nbsp; &nbsp;  { <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; shape= 'square';&nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp;  } <br />
else {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; shape = 'rectangle'<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
printf(&quot; the length is%d, breadth is %d , hence given shape is %s&quot;, length, breadth, shape);</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>dewdropz</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240214.html</guid>
		</item>
		<item>
			<title>Need help to create matrix</title>
			<link>http://www.daniweb.com/forums/thread240250.html</link>
			<pubDate>Sat, 21 Nov 2009 06:54:14 GMT</pubDate>
			<description>I have to create a matrix in c  from microarray data that so I have to read each string line wise and compare they are related or not. help me....*****</description>
			<content:encoded><![CDATA[<div>I have to create a matrix in c  from microarray data that so I have to read each string line wise and compare they are related or not. help me....<span style="font-weight:bold">***</span></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>rahul.nutron</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240250.html</guid>
		</item>
		<item>
			<title>Error in simple C menu</title>
			<link>http://www.daniweb.com/forums/thread240171.html</link>
			<pubDate>Sat, 21 Nov 2009 06:21:58 GMT</pubDate>
			<description><![CDATA[If I run the program, and select q, it will quit correctly.  If I select e it goes to the edit menu *but prints it twice*.  If I then select q it goes to the main menu *and prints the default case, "please select from menu", then prints the main menu again*.  If I select q now, it goes to the *edit...]]></description>
			<content:encoded><![CDATA[<div>If I run the program, and select q, it will quit correctly.  If I select e it goes to the edit menu <span style="font-weight:bold">but prints it twice</span>.  If I then select q it goes to the main menu <span style="font-weight:bold">and prints the default case, &quot;please select from menu&quot;, then prints the main menu again</span>.  If I select q now, it goes to the <span style="font-weight:bold">edit menu</span>, not quitting the program like it did before. So now it's stuck in a loop between main and edit when I select q.<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;&nbsp; <br />
#include &lt;stdlib.h&gt;<br />
<br />
void edit(void){<br />
<br />
printf (&quot;\nEDIT MENU\n&quot;);<br />
printf (&quot;&nbsp; (a)Add\n&quot;);<br />
printf (&quot;&nbsp; (p)Display\n&quot;);<br />
printf (&quot;&nbsp; (i)Reutrn\n&quot;);<br />
printf (&quot;&nbsp; (o)Check Out\n&quot;);<br />
printf (&quot;&nbsp; (d)Delete\n&quot;);<br />
printf (&quot;&nbsp; (q)Main Menu\n&quot;);<br />
<br />
<br />
char choice;<br />
scanf (&quot;%c&quot;,&amp;choice); <br />
<br />
switch (choice) {<br />
<br />
case 'a':<br />
&nbsp; system(&quot;./add&quot;);<br />
&nbsp; break;<br />
&nbsp; <br />
<br />
case 'p':<br />
&nbsp; system(&quot;./display&quot;);<br />
&nbsp; break;<br />
<br />
case 'i':<br />
&nbsp; system(&quot;./return&quot;);<br />
&nbsp; break;<br />
<br />
case 'o':<br />
&nbsp; system(&quot;./checkout&quot;);<br />
&nbsp; break;<br />
<br />
case 'd':<br />
&nbsp; system(&quot;./delete&quot;);<br />
&nbsp; break;<br />
<br />
case 'q':<br />
&nbsp; main();<br />
<br />
default:<br />
&nbsp; edit();<br />
<br />
}<br />
<br />
}<br />
<br />
void reports(void)<br />
{<br />
<br />
}<br />
<br />
void add(void)<br />
{<br />
}<br />
<br />
void del(voi)<br />
{<br />
}<br />
<br />
int main(void){<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
printf (&quot;MAIN MENU\n&quot;);<br />
printf (&quot;&nbsp; (e)Edit\n&quot;);<br />
printf (&quot;&nbsp; (r)Reports\n&quot;);<br />
printf (&quot;&nbsp; (q)Quit\n&quot;);<br />
<br />
char choice;<br />
scanf (&quot;%c&quot;,&amp;choice); <br />
<br />
switch (choice) {<br />
&nbsp; case 'e':<br />
&nbsp; edit();<br />
&nbsp; break;<br />
&nbsp; <br />
&nbsp; <br />
&nbsp; case 'r':<br />
&nbsp; reports();<br />
&nbsp; break;<br />
&nbsp; <br />
<br />
&nbsp; case 'q':<br />
&nbsp; break;<br />
<br />
&nbsp; default: <br />
&nbsp; printf(&quot;Choose from the menu\n&quot;);<br />
&nbsp; main();<br />
}<br />
return 0;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Mattpd</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240171.html</guid>
		</item>
		<item>
			<title>how to use the local variable form one function to other function</title>
			<link>http://www.daniweb.com/forums/thread240138.html</link>
			<pubDate>Sat, 21 Nov 2009 02:21:55 GMT</pubDate>
			<description><![CDATA[Here is the problem:write in saparate function without using global variable 
1/(function input)enter N in the range [0,20], then enter N numbers 
2/(function display)Display N numbers in 2 columns 
Here is my source code 
 
#include<stdio.h> 
#include<conio.h> 
void Input(int *p,int n) 
{ 
    int...]]></description>
			<content:encoded><![CDATA[<div>Here is the problem:write in saparate function without using global variable<br />
1/(function input)enter N in the range [0,20], then enter N numbers<br />
2/(function display)Display N numbers in 2 columns<br />
Here is my source code<br />
 <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
#include&lt;conio.h&gt;<br />
void Input(int *p,int n)<br />
{<br />
&nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; do<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp;  printf(&quot;Enter N numbers u want to input: &quot;);<br />
&nbsp; &nbsp;  scanf(&quot;%d&quot;,&amp;n); <br />
&nbsp; &nbsp; }while ( (n&lt;0) || (n&gt;20) );<br />
&nbsp; &nbsp; p =(int *)malloc(n*sizeof(int));<br />
&nbsp; &nbsp; printf(&quot;Ennter %d numbers: &quot;,n);<br />
&nbsp; &nbsp; for( i=0; i&lt;n; i++)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp;  printf(&quot;\nNumber%: &quot;,i);<br />
&nbsp; &nbsp; &nbsp; &nbsp;  scanf(&quot;%d&quot;,p+i);<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; <br />
}<br />
<br />
void Display(int *p, int n)<br />
{<br />
&nbsp; &nbsp;  int i;<br />
&nbsp; &nbsp;  printf(&quot;test&quot;);<br />
&nbsp; &nbsp;  for( i=0; i&lt;n; i++)<br />
&nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot; %d&quot;,p&#91;i&#93;);&nbsp; <br />
&nbsp; &nbsp;  }<br />
}<br />
<br />
int main()<br />
{<br />
&nbsp; int *a, *N;<br />
&nbsp; Input(a,&amp;N);<br />
&nbsp; Display(a,&amp;N);<br />
&nbsp; getch();<br />
&nbsp; return 0;<br />
}</pre>I don't know how can I use the variable N in function input for the next function.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>thebluestar</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240138.html</guid>
		</item>
		<item>
			<title>memcpy with int clears entire buffer</title>
			<link>http://www.daniweb.com/forums/thread240119.html</link>
			<pubDate>Sat, 21 Nov 2009 00:21:09 GMT</pubDate>
			<description>Hi, 
 
I have a char* buffer that is 1024 bytes in size, and am trying to write an int to a particular offset in the buffer, in this case 0, but all offsets have the same problem. 
 
I initialize the buffer to some values when I first start up.  For example, the first 8 bytes contain two separate...</description>
			<content:encoded><![CDATA[<div>Hi,<br />
<br />
I have a char* buffer that is 1024 bytes in size, and am trying to write an int to a particular offset in the buffer, in this case 0, but all offsets have the same problem.<br />
<br />
I initialize the buffer to some values when I first start up.  For example, the first 8 bytes contain two separate ints, followed by 2 chars.  When I print this out, it shows up as full.<br />
<br />
However, when I try to add another value as shown in the code below, it completely destroys all the other data in the buffer.<br />
<br />
 <pre style="margin:20px; line-height:13px">char* buffer = new char[1024];<br />
<br />
***buffer initialization code***<br />
<br />
int fd = 4;<br />
int bufferOffset = 0;<br />
<br />
memcpy(buffer + bufferOffset, &amp;fd, 4);<br />
<br />
cout &lt;&lt; buffer &lt;&lt; endl;</pre><br />
Does anyone know why this could be happening?  I'm under the impression that the above code should copy the 4 bytes of an int to my buffer, not completely destroy it.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>cmk2901</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240119.html</guid>
		</item>
		<item>
			<title>Pixel Count</title>
			<link>http://www.daniweb.com/forums/thread240064.html</link>
			<pubDate>Fri, 20 Nov 2009 18:44:43 GMT</pubDate>
			<description><![CDATA[The purpose of the program is to take a position and count how many "pixels" are in the "blob". If there is no "pixel" aka the value is 0, the blob number is 0. If there is a pixel, the blob_check function recursively checks the surrounding cells for "pixels" aka values of 1. My program compiles...]]></description>
			<content:encoded><![CDATA[<div>The purpose of the program is to take a position and count how many &quot;pixels&quot; are in the &quot;blob&quot;. If there is no &quot;pixel&quot; aka the value is 0, the blob number is 0. If there is a pixel, the blob_check function recursively checks the surrounding cells for &quot;pixels&quot; aka values of 1. My program compiles but doesn't accurately count the number of pixels in the blob. Please help!<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdlib.h&gt;<br />
#include &lt;stdio.h&gt;<br />
<br />
int blob_check(int tab[][], int x, int y);<br />
<br />
#define N 5<br />
<br />
int main(int argc, char *argv[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int x,y,i,j;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int row=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; char line[80];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int table[N][N] = { {1,1,0,0,0},<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {0,1,1,0,0},<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {0,0,1,0,1},<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {1,0,0,0,1},<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {0,1,0,1,1}};<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\t0\t1\t2\t3\t4\t&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n&nbsp;  -----------------------------------------&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;5;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n&nbsp;  |\n%d&nbsp; |\t&quot;, i);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(j=0;j&lt;5;j++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d\t&quot;, table[i][j]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n\nEnter x-y coordinates of cell&nbsp; =&gt; &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%d %d&quot;, &amp;x, &amp;y);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Pixel quantity in blob: %i\n&quot;, blob_check(table, x, y));<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; system(&quot;pause&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}<br />
<br />
int blob_check(int pic[N][N], int x, int y)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (pic[x][y] == 0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pic[x][y] = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int sum = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //check <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (x&gt;0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x-1, y);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (y&lt;N-1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x-1, y+1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if (y&lt;N-1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x, y+1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (x&lt;N-1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x+1, y+1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if (x&lt;N-1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x+1, y);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (y&gt;0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x+1, y-1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if (y&gt;0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x, y-1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (x&gt;0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; sum += blob_check(pic, x-1, y-1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return sum;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>cokacola</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240064.html</guid>
		</item>
		<item>
			<title>C program for to find optimal path</title>
			<link>http://www.daniweb.com/forums/thread240038.html</link>
			<pubDate>Fri, 20 Nov 2009 15:42:07 GMT</pubDate>
			<description>Time limit : 10 secs. (The program must produce output for all test cases within the stipulated time) 
 
A spaceship carrying a convention of high ranking officials had a close shave with a meteor. They are now scattered over the surface over a meteor and the spaceship is beyond repair. 
Fluke...</description>
			<content:encoded><![CDATA[<div>Time limit : 10 secs. (The program must produce output for all test cases within the stipulated time)<br />
<br />
A spaceship carrying a convention of high ranking officials had a close shave with a meteor. They are now scattered over the surface over a meteor and the spaceship is beyond repair.<br />
Fluke LandCrawler was an emergency replacement for a space rescue mission in the distant galaxy Alfa-Bentauri. You are KHAL – the computer on the land-Rover carrying Fluke. He needs to rescue as many survivors as possible but can’t figure out the best path. Fluke lied about his CompSc. Degree to get in to SpaceTravel Inc; he is banking on you to save his job. <br />
Just to make things worse, Fluke’s shuttle was designed by Elbonians and not tested before being deployed due to this unforeseen emergency. You now find that the “Back”, “Left”, “Right” and “Fwd” buttons on the shuttle are unintuitive to say the least: <br />
e.g. if Fluke’s Rover is in the slot marked as FL below  (facing east), there are 4 possible slots that he can move to (shown in Blue). In short, it can not move back (towards the west) and is always facing east. He can only rescue people by moving to the slot that they are standing in.<br />
 <br />
<br />
Each survivor of the crash has a rank R (1&lt;= R &lt;= 5) e.g. some are Chancellors Rank5 and at the other end of the spectrum are Guards Rank1. <br />
Determine the optimal path – that can <br />
-	 save a group of people with the maximum total rank. High ranking officials are key to maintaining peace across various factions in the federation. Guards are sworn to protect them and will stay behind if required.<br />
-	If you have one optimal path, you should tell Fluke the command seq for the same. If more than one path is optimal, you should tell Fluke all the possible command seq and let him decide<br />
-	Time is of the essence – it is critical that the people be rescued as quickly as possible. <br />
<br />
Input<br />
-	The first line contains n where n is the side of the square grid on which the rover will move. 4 &lt;= n &lt;= 100. Top-left co-ordinate is (0,0) and bottom right co-ordinate is (n-1, n-1)<br />
-	The next line is the number of test cases n (2 in the example below) that follow (&lt; 5). Each test case is comprised of a number of lines.<br />
o	The first line of the test case contains the position where the space rover is beamed down/placed initially (facing east).<br />
o	The next line contains the number of survivors, k.<br />
	This is followed by k lines, each having 3 integers relevant to each survivor. E.g. 1 3 5 indicates that there is a survivor at (1,3) and has Rank 5.<br />
<br />
4<br />
2<br />
0 1<br />
4<br />
1 3 5<br />
2 0 5<br />
2 2 1<br />
3 2 3<br />
0 1<br />
5<br />
1 3 5<br />
2 0 5<br />
2 2 5<br />
3 0 5<br />
3 2 3<br />
<br />
<br />
The test cases represent the following scenarios respectively.<br />
   					 <br />
<br />
Output<br />
You should print out the results to console (via printf or equivalent) <br />
For each test case, output the maximum cumulative rank of people you can save as the first line. That is to be followed by the command seq (1 or multiple) for the path(s) – See the example below.<br />
8 <br />
LB<br />
BL<br />
10 <br />
RF<br />
<br />
Explanation:<br />
<br />
     <br />
<br />
Rules:<br />
•	Your program must accept a string as a command line argument. It should then proceed to open the file of that name in the same/current directory, which contains one or more test cases. Output should be printed to console via printf (or equivalent).<br />
•	The program will not expect any user input. Please test your program for compile / run time errors before submitting.<br />
•	You may submit multiple submissions – strive for solutions that are elegant, memory and time efficient.<br />
•	The time limit if specified is for all the test cases to be executed; the time limit is NOT per test case</div>  <br /> <div style="padding:5px">     <fieldset class="fieldset"> <legend>Attached Files</legend> <table cellpadding="0" cellspacing="5" border="0"> <tr> <td><img class="inlineimg" src="http://www.daniweb.com/forums/images/attach/doc.gif" alt="File Type: doc" width="16" height="16" border="0" style="vertical-align:baseline" /></td> <td><a href="http://www.daniweb.com/forums/attachment.php?attachmentid=12648&amp;d=1258731651">BIQ-004-KHAL_222.doc</a> (50.5 KB)</td> </tr> </table> </fieldset>  </div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>kirtics344</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240038.html</guid>
		</item>
		<item>
			<title>Interesting C program for Accelerator</title>
			<link>http://www.daniweb.com/forums/thread240036.html</link>
			<pubDate>Fri, 20 Nov 2009 15:33:44 GMT</pubDate>
			<description>You’ve been given an assorted set of gears. Each gear has a different number of teeth – the notches on a gear that interlock with notches on another gear to transmit speed. You have a couple of belts one coupled to an input and the other for the output. You are given the rpm of the input belt Si...</description>
			<content:encoded><![CDATA[<div>You’ve been given an assorted set of gears. Each gear has a different number of teeth – the notches on a gear that interlock with notches on another gear to transmit speed. You have a couple of belts one coupled to an input and the other for the output. You are given the rpm of the input belt Si and a minimum value So (where So &gt; Si) so that you can increase the speed via a system of gears as shown above<br />
You need to figure out all the possible pairs of gears that can be used to achieve an output rpm &gt;= So.<br />
Input<br />
The input is specified in a file containing test-cases.<br />
•	The first line contains the number of gears that are available to you, g.<br />
•	The next line contains g numbers indicating the number of teeth on each gear, separated by spaces.<br />
•	The next line contains the number of test cases – n<br />
o	This is followed by n test cases. Each test case is specified by 2 speed values on a single line. (So here the first test case specifies that you need to design a gear-system that increases Si = 50 rpm to a value above 200 rpm)<br />
7<br />
20 10 4 6 40 25 100<br />
2<br />
50 200<br />
35 75<br />
<br />
Output<br />
9<br />
15<br />
<br />
E.g. for raising the speed from 50 to 200, any of the following 9 pairs can be used<br />
 [100, 6] [40, 6] [25, 6] [25, 4] [20, 4] [40, 4] [100, 4] [100, 20] [100, 10]<br />
<br />
Rules :<br />
•	Your program must accept a string as a command line argument. It should then proceed to open the file of that name in the same/current directory, which contains one or more test cases. Output should be printed to console via printf (or equivalent).<br />
•	The program will not expect any user input. Please test your program for compile / run time errors before submitting.<br />
•	You may submit multiple submissions – strive for solutions that are elegant, memory and time efficient.<br />
•	The time limit if specified is for all the test cases to be executed; the time limit is NOT per test case<br />
* We would compile your program into an executable and run it (e.g. c:\&gt;X.exe TestCases.txt)</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>kirtics344</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240036.html</guid>
		</item>
		<item>
			<title>How to create a dynamic array in recursion?</title>
			<link>http://www.daniweb.com/forums/thread240008.html</link>
			<pubDate>Fri, 20 Nov 2009 12:55:13 GMT</pubDate>
			<description>Hi all. Just a simple question but I SERIOUSLY need some help from you guys for my programming assignment. 
 
The assignment given was water jug problem.  
 
Now my question is, does C allow for the creation of dynamic array during a recursion?  
Suppose I have another function, which returns a...</description>
			<content:encoded><![CDATA[<div>Hi all. Just a simple question but I SERIOUSLY need some help from you guys for my programming assignment.<br />
<br />
The assignment given was water jug problem. <br />
<br />
Now my question is, does C allow for the creation of dynamic array during a recursion? <br />
Suppose I have another function, which returns a value (well in my case the function returns a character), and I'm gonna store the character into a dynamic array(which in the current function). This means that the dynamic array is constantly &quot;enlarged&quot; as long as another function returns a value to the current function where the dynamic array is located. If the other function stops returning a value, the whole process stops.<br />
<br />
Thanks in advance.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>beatenbob</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread240008.html</guid>
		</item>
		<item>
			<title><![CDATA[Standards & Implementations]]></title>
			<link>http://www.daniweb.com/forums/thread239967.html</link>
			<pubDate>Fri, 20 Nov 2009 08:56:56 GMT</pubDate>
			<description>Hi ,  
this one is with respect to C. 
(i) 
when we use array an array index always starts from zero . 
is it a standard one? or compilers are implemented that way? 
if compilers are implented that way they must have followed some standard. 
(ii) 
the array name cannot be changed is it the standard...</description>
			<content:encoded><![CDATA[<div>Hi , <br />
this one is with respect to C.<br />
(i)<br />
when we use array an array index always starts from zero .<br />
is it a standard one? or compilers are implemented that way?<br />
if compilers are implented that way they must have followed some standard.<br />
(ii)<br />
the array name cannot be changed is it the standard or compiler dependent.<br />
<br />
i have never heard that array index starts from 1 and base address can be changed.<br />
<br />
Thanks,<br />
Danian</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Iam3R</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239967.html</guid>
		</item>
		<item>
			<title>errors in C program..plz help</title>
			<link>http://www.daniweb.com/forums/thread239931.html</link>
			<pubDate>Fri, 20 Nov 2009 05:57:06 GMT</pubDate>
			<description><![CDATA[Hi, 
I am new to this site. 
Can you please help me with this. I have written a C program and i m getting the following errors 
1)  "  'puts' was not declared in scope   " 
the same error for 'gets' and 'itoa' command...i have included stdio.h,string.h,stdlib.h,math.h  as the header files 
2)"...]]></description>
			<content:encoded><![CDATA[<div>Hi,<br />
I am new to this site.<br />
Can you please help me with this. I have written a C program and i m getting the following errors<br />
1)  &quot;  'puts' was not declared in scope   &quot;<br />
the same error for 'gets' and 'itoa' command...i have included stdio.h,string.h,stdlib.h,math.h  as the header files<br />
2)&quot; expected constructor , destructor or type conversion before '=' token &quot;    ......for the code k=1.92 ....i have declared 'k' as a float<br />
3) expected ',' before '}' token<br />
<br />
kindly clear my queries<br />
Thank you,<br />
sahasra.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>sahasra</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239931.html</guid>
		</item>
		<item>
			<title>A challenging problem in Recursion</title>
			<link>http://www.daniweb.com/forums/thread239918.html</link>
			<pubDate>Fri, 20 Nov 2009 04:30:08 GMT</pubDate>
			<description><![CDATA[At least for me it is:) 
This is an assignment problem and I can really use some help! 
 
*_INTRO TO PROBLEM:_* 
So the problem is a basic logic problem, where I'm sure you're all familiar with... 
From my assignment page, the problem 
  <div class="codeblock"> <div class="spaced"> <div...]]></description>
			<content:encoded><![CDATA[<div>At least for me it is:)<br />
This is an assignment problem and I can really use some help!<br />
<br />
<span style="font-weight:bold"><span style="text-decoration:underline">INTRO TO PROBLEM:</span></span><br />
So the problem is a basic logic problem, where I'm sure you're all familiar with...<br />
From my assignment page, the problem<br />
 <pre style="margin:20px; line-height:13px">Imagine that you have 2 jugs, a small one and a large one, with integer capacities of sCap<br />
and lCap gallons, respectively (sCap &lt; lCap). Initially both jugs are empty. You are<br />
allowed to completely fill each jug from a tap, or empty them on the ground. You can also<br />
pour one jug into the other: pouring stops when either the receiving jug is full or no water is left<br />
in the pouring jug (i.e. no water is spilled). Note that each pouring action will cause a positive<br />
number of whole gallons to be transferred.<br />
Given two integer values sFinal and lFinal, the problem is to find a valid sequence<br />
of actions such that after performing the actions, the small and large jugs contain exactly<br />
sFinal and lFinal gallons of water, respectively.</pre><br />
<span style="text-decoration:underline"><span style="font-weight:bold">WHAT I NEED HELP ON</span></span><br />
Basically I have a few functions that are ready to be used...<br />
I will attach a .c file at the end of this post for the code...<br />
I took a long time checking over this post and adding comments, any sort of help on recursion is appreciated...<br />
I just don't understand how to start this recursion<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;stdbool.h&gt;<br />
#include &lt;math.h&gt;<br />
#include &lt;string.h&gt;<br />
<br />
char&nbsp; *solve(const char curSequence[], int sCur, int lCur, int sCap, int lCap, int sFinal, int lFinal);<br />
void prettyPrint(const char solution[], int sCap, int lCap);<br />
bool actionIsPossible(char action, int sCur, int lCur, int sCap, int lCap);<br />
void getUpdatedJugsAmounts(char action, int sCur, int lCur, int sCap, int lCap, int *sUpdated, int *lUpdated);<br />
bool occurs(const char curSequence[], int sVal, int lVal, int sCap, int lCap);<br />
bool applyAction(char action, const char curSequence[], int sCur, int lCur, int sCap, int lCap, char updatedSequence[], int *sUpdated, int *lUpdated);<br />
<br />
//a testing main method that was given<br />
int main(int argc, char *argv[])<br />
{<br />
&nbsp; int sCap, lCap, sFinal, lFinal;<br />
&nbsp; if (argc &lt; 5)<br />
&nbsp; {<br />
&nbsp; &nbsp; printf(&quot;Usage: jugs smallCapacity largeCapacity smallFinal largeFinal\n&quot;);<br />
&nbsp; &nbsp; return 0;<br />
&nbsp; }<br />
&nbsp; sCap = atoi(argv[1]);<br />
&nbsp; lCap = atoi(argv[2]);<br />
&nbsp; sFinal = atoi(argv[3]);<br />
&nbsp; lFinal = atoi(argv[4]);*/<br />
<br />
&nbsp; char *solution;<br />
&nbsp; solution =&nbsp; solve(&quot;&quot;, 0, 0, 3, 4, 0, 2);<br />
&nbsp; printf(&quot;The solution is: %s\n&quot;, solution);<br />
&nbsp; if (strcmp(solution, &quot;Not Found&quot;) != 0)<br />
&nbsp; &nbsp;  prettyPrint(solution, sCap, lCap);<br />
<br />
&nbsp; free(solution);<br />
&nbsp; return 0;<br />
}<br />
//This is the function I'm having trouble with...<br />
//Basically this function should follow this idea<br />
////////////////////////////////////////////////////////////////////////<br />
/*char *solve(curSequence, curConfig, capacities, finalConfig)<br />
//&nbsp; &nbsp; &nbsp; &nbsp; if the current configuration == the final configuration then<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; it means that no further action is needed so simply<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; allocate space and return a copy of curSequence as the solution<br />
//&nbsp; &nbsp; &nbsp; &nbsp; else<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pick one of the 6 actions and apply it to the curConfig<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (you may want to call applyAction)<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if the action is applicable (i.e. it is possible and it<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; does not create a cycle) and a recursive call to<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; solve(updatedSequence, updatedConfig, capacities, finalConfig)<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; returns a solution then return this solution<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; otherwise clean up any dynamically allocated spaces and if any<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; un-tried action is left, then try it (as above)<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if no more action is left to try then<br />
//&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; allocate space and return the string &quot;Not Found&quot;.8?*/<br />
//////////////////////////////////////////////////////////////////////<br />
///////////////////my crappy recursion////////////////////////////////<br />
char *solve(const char curSequence[], int sCur, int lCur, int sCap, int lCap, int sFinal, int lFinal){<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (sCur == sFinal &amp;&amp; lCur == lFinal) {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(i = 0; curSequence[i] != '\0'; i++);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; char *solution = (char *)malloc(i*sizeof(char *));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(solution,curSequence);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return solution;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; char *solution = (char *)malloc(sizeof(char *));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;here\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; char *curAct = (char *) malloc (sizeof(char *));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; char god[] = {'f', 'F', 'p', 'P', 'e', 'E'};<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(i = 0; i &lt; 6; i++){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(applyAction(god[i], solution, sCur, lCur, sCap, lCap, curAct, &amp;sCur, &amp;lCur)){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; curAct = solve(solution, sCur, lCur, sCap, lCap, sFinal, lFinal);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;recur\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; free(curAct);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcat(solution,curAct);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return solution;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  solution = (char *)malloc(sizeof(char)*(strlen(&quot;Not Found&quot;) + 1));<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcpy(solution,&quot;Not Found&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; return solution;<br />
}<br />
//A simple print method in the format &lt;S0, L0&gt; A1 &lt;S1, L1&gt; so on<br />
void prettyPrint(const char curSequence[], int sCap, int lCap){<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i, j = strlen(curSequence)+1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int s = 0, l = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i = 0 ; i &lt; j; i++){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;&lt;%d,%d&gt; &quot;, s, l);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; getUpdatedJugsAmounts(curSequence[i], s, l, sCap, lCap, &amp;s, &amp;l);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%c &quot;, curSequence[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
//There are certain restrictions on which action is possible at a given configuration<br />
//returns true if possible, false otherwise<br />
bool actionIsPossible(char action, int sCur, int lCur, int sCap, int lCap){<br />
&nbsp; &nbsp; bool final = false;<br />
&nbsp; &nbsp; if (action == 'f' &amp;&amp; sCur &lt; sCap){final = true;} //the small jug is not already full<br />
&nbsp; &nbsp; else if (action == 'F' &amp;&amp; lCur &lt; lCap){final = true;} //the big jug is not already full<br />
&nbsp; &nbsp; else if (action == 'p' &amp;&amp; sCur &gt; 0 &amp;&amp; lCur &lt; lCap){final = true;} //the small jug is not empty AND the big jug is not full<br />
&nbsp; &nbsp; else if (action == 'P' &amp;&amp; lCur &gt; 0 &amp;&amp; sCur &lt; sCap){final = true;} //the big jug is not empty AND the small jug is not full<br />
&nbsp; &nbsp; else if (action == 'e' &amp;&amp; sCur &gt; 0){final = true;} //the small jug is not already empty<br />
&nbsp; &nbsp; else if (action == 'E' &amp;&amp; lCur &gt; 0){final = true;} //the big jug is not already empty <br />
&nbsp; &nbsp; return final;<br />
}<br />
//calculated the new amounts and returns them through pointers<br />
void getUpdatedJugsAmounts(char action, int sCur, int lCur, int sCap, int lCap, int *sUpdated, int *lUpdated){<br />
&nbsp; &nbsp; *sUpdated = sCur; *lUpdated = lCur;<br />
&nbsp; &nbsp; if (action == 'f'){*sUpdated = sCap;}<br />
&nbsp; &nbsp; else if (action == 'F'){*lUpdated = lCap;}<br />
&nbsp; &nbsp; else if (action == 'p'){for (; lCur &lt; lCap &amp;&amp; sCur &gt; 0; sCur--, lCur++);*sUpdated = sCur; *lUpdated = lCur;}<br />
&nbsp; &nbsp; else if (action == 'P'){for (; sCur &lt; sCap &amp;&amp; lCur &gt; 0; lCur--, sCur++);*sUpdated = sCur; *lUpdated = lCur;}<br />
&nbsp; &nbsp; else if (action == 'e'){*sUpdated = 0;}<br />
&nbsp; &nbsp; else if (action == 'E'){*lUpdated = 0;}<br />
}<br />
//If the given sequence does not for a repeated config/cycle<br />
//ie: if you start wiht &lt;0,0&gt; and perform PP on sCap = 3 lCap = 4, first &lt;0,4&gt; then &lt;0,4&gt;, which gives u a repeated configuration...<br />
//returns true if there is a repeated config, false otherwise<br />
bool occurs(const char curSequence[], int sVal, int lVal, int sCap, int lCap){<br />
&nbsp; &nbsp; int i, j = strlen(curSequence)+1;<br />
&nbsp; &nbsp; int sCur = 0, lCur = 0;<br />
&nbsp; &nbsp; bool final = false;<br />
&nbsp; &nbsp; if (sVal == 0 &amp;&amp; lVal == 0){final = true;}<br />
&nbsp; &nbsp; for (i = 0; i &lt; j ; i++){<br />
&nbsp; &nbsp; &nbsp; &nbsp;  //printf(&quot;%d = %d %d = %d\n&quot;,sCur,sVal,lCur,lVal);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (actionIsPossible(curSequence[i], sCur, lCur, sCap, lCap)){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; getUpdatedJugsAmounts(curSequence[i], sCur, lCur, sCap, lCap, &amp;sCur, &amp;lCur);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (sCur == sVal &amp;&amp; lCur == lVal){final = true;}<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
&nbsp; &nbsp; return final;<br />
}<br />
//apply the action, update the sequence with the new action, and pass the new values back with points and the updated sequence with the array.<br />
//return true if the action is possible and does not cycle, false otherwise<br />
bool applyAction(char action, const char curSequence[], int sCur, int lCur, int sCap, int lCap, char updatedSequence[], int *sUpdated, int *lUpdated){<br />
&nbsp; &nbsp; &nbsp; &nbsp; bool final = false;<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcpy(updatedSequence,curSequence);<br />
&nbsp; &nbsp; &nbsp; &nbsp; int s = 0, l = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; const char act[2] = {action};<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (actionIsPossible(action, sCur, lCur, sCap, lCap)){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; getUpdatedJugsAmounts(action, sCur, lCur, sCap, lCap, &amp;s, &amp;l);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (!occurs(curSequence, sCur, lCur, sCap, lCap)){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; *sUpdated = s;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; *lUpdated = l;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; updatedSequence = strcat(updatedSequence,act);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; final = true;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; return final;<br />
}</pre><br />
Thank you again for any help!</div>  <br /> <div style="padding:5px">     <fieldset class="fieldset"> <legend>Attached Files</legend> <table cellpadding="0" cellspacing="5" border="0"> <tr> <td><img class="inlineimg" src="http://www.daniweb.com/forums/images/attach/c.gif" alt="File Type: c" width="16" height="16" border="0" style="vertical-align:baseline" /></td> <td><a href="http://www.daniweb.com/forums/attachment.php?attachmentid=12643&amp;d=1258691334">Waterjugs.c</a> (6.7 KB)</td> </tr> </table> </fieldset>  </div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Tamaki</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239918.html</guid>
		</item>
		<item>
			<title>round robin</title>
			<link>http://www.daniweb.com/forums/thread239917.html</link>
			<pubDate>Fri, 20 Nov 2009 04:25:11 GMT</pubDate>
			<description>i want program for round robin in c</description>
			<content:encoded><![CDATA[<div>i want program for round robin in c</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>lathachowdary</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239917.html</guid>
		</item>
		<item>
			<title><![CDATA[left operand of -> has incompatible type]]></title>
			<link>http://www.daniweb.com/forums/thread239850.html</link>
			<pubDate>Thu, 19 Nov 2009 21:40:32 GMT</pubDate>
			<description><![CDATA[Hello  
 
Im trying to compile the following code but I get the error "left operand has incompatible type" because of the line:  
 
 test2_2_U->Out2=  test2_2_U->Out3; 
 
I have been looking through the forum but I couldnt find a hint what Im doing wrong. Any hint is appreciated.  
 
Thanks Thomas]]></description>
			<content:encoded><![CDATA[<div>Hello <br />
<br />
Im trying to compile the following code but I get the error &quot;left operand has incompatible type&quot; because of the line: <br />
<br />
 test2_2_U-&gt;Out2=  test2_2_U-&gt;Out3;<br />
<br />
I have been looking through the forum but I couldnt find a hint what Im doing wrong. Any hint is appreciated. <br />
<br />
Thanks Thomas<br />
<br />
<br />
 <pre style="margin:20px; line-height:13px">static BlockIO_test2_2 test2_2_B;&nbsp; &nbsp; &nbsp; /* Observable signals */<br />
static D_Work_test2_2 test2_2_DWork;&nbsp;  /* Observable states */<br />
static ExternalInputs_test2_2 test2_2_U;/* External inputs */<br />
static ExternalOutputs_test2_2 test2_2_Y;/* External outputs */<br />
<br />
void rt_OneStep(RT_MODEL_test2_2 *test2_2_M)<br />
{<br />
&nbsp;<br />
&nbsp;test2_2_step(&amp;test2_2_B, &amp;test2_2_DWork, &amp;test2_2_U, &amp;test2_2_Y);<br />
&nbsp;test2_2_Y-&gt;Out2=&nbsp; test2_2_Y-&gt;Out3;<br />
<br />
}</pre><br />
where test2_2_U is defined as: <br />
<br />
 <pre style="margin:20px; line-height:13px"><br />
&nbsp;  66&nbsp;  typedef struct {<br />
&nbsp;  67&nbsp; &nbsp;  real_T Out1_f;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* '&lt;Root&gt;/Out1' */<br />
&nbsp;  68&nbsp; &nbsp;  real_T Out2;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* '&lt;Root&gt;/Out2' */<br />
&nbsp;  69&nbsp; &nbsp;  real_T Out3;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* '&lt;Root&gt;/Out3' */<br />
&nbsp;  70&nbsp; &nbsp;  real_T Out4;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* '&lt;Root&gt;/Out4' */<br />
&nbsp;  71&nbsp;  } ExternalOutputs_test2_2;<br />
&nbsp;  72</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>agentmusic</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239850.html</guid>
		</item>
		<item>
			<title>Problem with permuting bits</title>
			<link>http://www.daniweb.com/forums/thread239843.html</link>
			<pubDate>Thu, 19 Nov 2009 20:44:04 GMT</pubDate>
			<description><![CDATA[I am having a slight problem implementing this code.  What I need to do is take a list of 16 unsigned characters and permute the bits according to IPTable.  0 in IPTable refers to bit 0, 1 refers to bit 1, etc.  Here is my code which isn't working. 
 
 
unsigned char IPTable[128] = {0, 32, 64, 96,...]]></description>
			<content:encoded><![CDATA[<div>I am having a slight problem implementing this code.  What I need to do is take a list of 16 unsigned characters and permute the bits according to IPTable.  0 in IPTable refers to bit 0, 1 refers to bit 1, etc.  Here is my code which isn't working.<br />
<br />
 <pre style="margin:20px; line-height:13px">unsigned char IPTable&#91;128&#93; = {0, 32, 64, 96, 1, 33, 65, 97, 2, 34, 66, 98, 3, 35, 67, 99, 4, 36, 68, 100, 5, 37, 69, 101, 6, 38, 70, 102, 7, 39, 71, 103, 8, 40, 72, 104, 9, 41, 73, 105, 10, 42, 74, 106, 11, 43, 75, 107, 12, 44, 76, 108, 13, 45, 77, 109, 14, 46, 78, 110, 15, 47, 79, 111, 16, 48, 80, 112, 17, 49, 81, 113, 18, 50, 82, 114, 19, 51, 83, 115, 20, 52, 84, 116, 21, 53, 85, 117, 22, 54, 86, 118, 23, 55, 87, 119, 24, 56, 88, 120, 25, 57, 89, 121, 26, 58, 90, 122, 27, 59, 91, 123, 28, 60, 92, 124, 29, 61, 93, 125, 30, 62, 94, 126, 31, 63, 95, 127};<br />
<br />
void IP(unsigned char * input, unsigned char * output)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; unsigned char i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; 128; i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; output&#91;i / 8&#93; ^= (128 &gt;&gt; (IPTable&#91;i&#93; % 8)) &amp; input&#91;IPTable&#91;i&#93;&#93;;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }</pre>Thanks for the help.  By the way this code definitely won't work if output isn't set to all zeroes, I already know that and that isn't the error.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>kolosick.m188</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239843.html</guid>
		</item>
		<item>
			<title>shell programming in c</title>
			<link>http://www.daniweb.com/forums/thread239817.html</link>
			<pubDate>Thu, 19 Nov 2009 18:09:39 GMT</pubDate>
			<description><![CDATA[hi 
please can any one help me in my shell project 
like this : 
 
Develop a c program which serve as s shell interface that accepts user command and then executes each command in separate process. The shell interface provides a command prompt ( sh> ) after which next command is entered .  
 
 ...]]></description>
			<content:encoded><![CDATA[<div>hi<br />
please can any one help me in my shell project<br />
like this :<br />
<br />
Develop a c program which serve as s shell interface that accepts user command and then executes each command in separate process. The shell interface provides a command prompt ( sh&gt; ) after which next command is entered . <br />
<br />
 <pre style="margin:20px; line-height:13px">#define TRUE 1 <br />
<br />
while(TRUE){ //repeat forever <br />
&nbsp; type_prompt(); //display prompt on the screen <br />
&nbsp; read_command (command, parameters); //read input from terminal <br />
&nbsp; if(fork()!=0){ //fork off child process <br />
&nbsp; waitpid(‐1, &amp;status, 0); //wait for child to exit <br />
&nbsp; } <br />
else{ <br />
&nbsp; execve(command, parameters, 0); //execute command <br />
&nbsp; } <br />
}</pre><br />
 <br />
Write a shell that is similar to the above code snippet, but contains enough code that it actually works so you can test it. You may also add some features such as redirection of in input and output, pipes, and background jobs. <br />
If the user entered “&amp; “ at the end of his/her command, then the process (command) will be executed in the background and the shell WILL Not WAIT It To Terminate. <br />
You can experience background process yourself by trying the following command on bash shell. <br />
&gt; kwrite <br />
The kwrite application will be run, and the shell prompt will not prompt a user until you terminate kwrite. On the contrary, if you tried the following command, the prompt will return to the user to accept other commands while kwrite (child process) is running in the background!<br />
 please</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>dena</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239817.html</guid>
		</item>
		<item>
			<title>Code Snippet Linked List</title>
			<link>http://www.daniweb.com/code/snippet239653.html</link>
			<pubDate>Thu, 19 Nov 2009 05:52:48 GMT</pubDate>
			<description><![CDATA[*This is just a linked list program for those who need help understanding the fundamentals. Put comments if you find some bugs. 
The program is about maintaining a student database (their roll number and their age) 
I've used Turbo C++ 4.5 as the compiler* 
 
:icon_cool:]]></description>
			<content:encoded><![CDATA[<div><span style="font-weight:bold">This is just a linked list program for those who need help understanding the fundamentals. Put comments if you find some bugs.<br />
The program is about maintaining a student database (their roll number and their age)<br />
I've used Turbo C++ 4.5 as the compiler</span><br />
<br />
:icon_cool:</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>xavier666</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239653.html</guid>
		</item>
		<item>
			<title>Comparing different lines in a file</title>
			<link>http://www.daniweb.com/forums/thread239641.html</link>
			<pubDate>Thu, 19 Nov 2009 04:31:55 GMT</pubDate>
			<description>Hello, 
If I want to say compare a line at a given line number to another line at a different given line number how can I do this? I know I could iterate through the file and store the lines into a data structure and perform comparisons that way but the file is very large and was wondering how I...</description>
			<content:encoded><![CDATA[<div>Hello,<br />
If I want to say compare a line at a given line number to another line at a different given line number how can I do this? I know I could iterate through the file and store the lines into a data structure and perform comparisons that way but the file is very large and was wondering how I could avoid that without taking up more memory? Or any other thoughts, thanks.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>flipjoebanana</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239641.html</guid>
		</item>
		<item>
			<title>help with adding primes</title>
			<link>http://www.daniweb.com/forums/thread239629.html</link>
			<pubDate>Thu, 19 Nov 2009 03:23:39 GMT</pubDate>
			<description><![CDATA[now I have never posted before so I hope this is in the right spot/format.. 
 
this problem is driving me insane. I need prove the Goldbach conjecture that is, "every even integer n > 2 is equal to the sum of 2 prime numbers." Then with a starting point and ending point prove this. (Ei: start at 2...]]></description>
			<content:encoded><![CDATA[<div>now I have never posted before so I hope this is in the right spot/format..<br />
<br />
this problem is driving me insane. I need prove the Goldbach conjecture that is, &quot;every even integer n &gt; 2 is equal to the sum of 2 prime numbers.&quot; Then with a starting point and ending point prove this. (Ei: start at 2 end at 10 =&gt; 2 = 1 +1, 4 = 1 + 3....10 = 5 + 5)<br />
<br />
The problem that I have is that I cant seem to figure out what is wrong with my code. When I run it the loop jumps over some intervals that it couldn't find a prime for and I just don't really know how to fix this as well as making the intervals go up 2 instead of 1 without a syntax error.<br />
<br />
now this is what I have so far...<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;time.h&gt;<br />
<br />
<br />
/* function to create a random number */<br />
<br />
int randomInteger(int low, int high)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; static short firstRun = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int offset;<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(firstRun)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //If this is the first call to this procedure, randomize the seed<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; srand(time(NULL));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //and set first run to 0 so we know its&nbsp; been run<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; firstRun = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; offset = low;<br />
&nbsp; &nbsp; &nbsp; &nbsp; low = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; high -=offset;<br />
&nbsp; &nbsp; &nbsp; &nbsp; return ((rand()%high)+offset);<br />
}<br />
<br />
<br />
/* function to see if a number is prime */<br />
<br />
int prime_check(int num)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int check = 0;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=1;i&lt;=num;i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(num % i == 0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; check = check +1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(check == 2)<br />
&nbsp; &nbsp; &nbsp; &nbsp; /* printf(&quot;number is prime\n&quot;); */<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 1;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; /*printf(&quot;number is not prime\n&quot;);*/<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}<br />
<br />
<br />
<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int a,b,i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int prime1, prime2;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int start = 2;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int end = 20;<br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i = start; i &lt;= end; i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; prime1 = randomInteger(1,i);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; a = prime_check(prime1);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(a==1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; prime2 = (i - prime1);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; b = prime_check(prime2);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(b==1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d = %d + %d\n&quot;, i, prime1, prime2);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; randomInteger(1,i);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; randomInteger(1,i);<br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /*lets me see what numbers the program skipped*/<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d\n&quot;, i);<br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre><br />
when I compile and run it I get something that looks like this...<br />
<br />
2<br />
3<br />
4 = 2 +2<br />
5 = 3 +2<br />
6<br />
7 = 5 + 2<br />
8 = 5 + 3<br />
9<br />
10 = 5 +5<br />
11<br />
12<br />
13<br />
14 = 7 +7<br />
15 <br />
16<br />
17<br />
18 = 5 + 13<br />
19 = 17 + 2<br />
20</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>eskaflowne</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239629.html</guid>
		</item>
		<item>
			<title>Hash and Rehash</title>
			<link>http://www.daniweb.com/forums/thread239608.html</link>
			<pubDate>Thu, 19 Nov 2009 01:32:49 GMT</pubDate>
			<description>I have been working on a basic accounting program, the accounts were supposed to be stored in a array, but I never got that part of the program working.  Is there anyway I can get a sample of hash code that would help me understand what I need to do?  In my case, I am trying to get the account...</description>
			<content:encoded><![CDATA[<div>I have been working on a basic accounting program, the accounts were supposed to be stored in a array, but I never got that part of the program working.  Is there anyway I can get a sample of hash code that would help me understand what I need to do?  In my case, I am trying to get the account numbers to be stored in the hash array (that's how he worded it in class).  I have searched through my book for the class and I did not find anything about hashing.  <br />
<br />
Any tips, tricks, or code sample would be appreciated.  <br />
<br />
Thanks in advance!</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>MeBjess</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239608.html</guid>
		</item>
		<item>
			<title>decimal to binary, palindrome!</title>
			<link>http://www.daniweb.com/forums/thread239589.html</link>
			<pubDate>Wed, 18 Nov 2009 22:58:27 GMT</pubDate>
			<description><![CDATA[hi all!!,  
 
can somebody help me?? 
 
I need to do a program that scan a decimal, transform it to binary and check if it is palindrome or not and print "palidrome" or "not palindrome".... 
 
i can only use functions and cant use arrays or anything else! 
 
can somebody help me??? 
these week i...]]></description>
			<content:encoded><![CDATA[<div>hi all!!, <br />
<br />
can somebody help me??<br />
<br />
I need to do a program that scan a decimal, transform it to binary and check if it is palindrome or not and print &quot;palidrome&quot; or &quot;not palindrome&quot;....<br />
<br />
i can only use functions and cant use arrays or anything else!<br />
<br />
can somebody help me???<br />
these week i got really sick and i need to give that in and im blank!!... help!<br />
<br />
thanx</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>lisedaton</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239589.html</guid>
		</item>
		<item>
			<title>read a string input</title>
			<link>http://www.daniweb.com/forums/thread239551.html</link>
			<pubDate>Wed, 18 Nov 2009 20:36:21 GMT</pubDate>
			<description><![CDATA[Hi, 
I want to make a program that reads a string.  
But I would like to read only characters, neither numbers nor special characters(@,#$%^&*()!). Also, no spaces between characters. 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>Hi,<br />
I want to make a program that reads a string. <br />
But I would like to read only characters, neither numbers nor special characters(@,#$%^&amp;*()!). Also, no spaces between characters.<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;string.h&gt;<br />
<br />
char *enter_a_string(int maxcharacters)<br />
{<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; char *ptr;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int len;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Enter string : &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; char array[50];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; do{<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; scanf(&quot;%s&quot;,array);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; len = strlen(array);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(len &gt; maxcharacters)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Maximum %d&nbsp; characters. Try again : &quot;,maxcharacters);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }while(len &gt; maxcharacters);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; ptr = array;<br />
<br />
return ptr;<br />
}<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char array[50];<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcpy(array,get_personal_elements(15));<br />
}</pre><br />
Could someone help me please?<br />
Thanks a lot</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>bufospro</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239551.html</guid>
		</item>
		<item>
			<title>simple string problem</title>
			<link>http://www.daniweb.com/forums/thread239517.html</link>
			<pubDate>Wed, 18 Nov 2009 17:51:07 GMT</pubDate>
			<description>So everything in my program works except for the main itself.  The program is supposed to take in a file provided through standard input and print out the descending order of words followed by the frequency that they occur.  I can do this individually line for line but am having trouble putting it...</description>
			<content:encoded><![CDATA[<div>So everything in my program works except for the main itself.  The program is supposed to take in a file provided through standard input and print out the descending order of words followed by the frequency that they occur.  I can do this individually line for line but am having trouble putting it together as a whole to count all the lines and not just one specific line.  Here is my code:<br />
<br />
 <pre style="margin:20px; line-height:13px">blade71(382)% cat test.c<br />
#include &lt;stdio.h&gt;<br />
#include &lt;string.h&gt;<br />
<br />
#define MAX_WORD_LENGTH&nbsp; &nbsp; 31<br />
#define MAX_TEXT_LENGTH 10000<br />
#define TRUE&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 1<br />
#define FALSE&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  0<br />
#define BUFSIZE 100<br />
<br />
/* Structure defining a count of the occurrences of a given word */<br />
struct WordCounter<br />
{<br />
&nbsp;char *word;<br />
&nbsp;int word_count;<br />
&nbsp;struct WordCounter *pNext;&nbsp; /* Pointer to the next word counter in the list */<br />
};<br />
<br />
&nbsp; &nbsp; &nbsp; /* Function prototypes */<br />
void addWord(char *pWord);<br />
/* Adds a word to the list or updates exisiting word */<br />
int is_separator(char ch);<br />
/* Tests for a separator character */<br />
void show(struct WordCounter *pWordcounter);<br />
/* Outputs a word and its count of occurrences */<br />
struct WordCounter* createWordCounter(char *word);<br />
/* Creates a new WordCounter structure */<br />
int getword(char *, int);<br />
/* Self explanitory */<br />
int getch(void);<br />
void ungetch(int);<br />
<br />
&nbsp; &nbsp; &nbsp; /* Global variables */<br />
struct WordCounter *pStart = NULL;<br />
/* Pointer to first word counter in the list */<br />
char buf[BUFSIZE];<br />
int bufp = 0;<br />
<br />
main()<br />
{<br />
&nbsp;char text[MAX_TEXT_LENGTH];&nbsp; &nbsp; /* Stores input text */<br />
&nbsp;char buffer[MAX_WORD_LENGTH];&nbsp; /* Buffer to hold a word */<br />
&nbsp;size_t i = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /* Index to text */<br />
&nbsp;int len = 0 ;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /* Word length */<br />
&nbsp;struct WordCounter *pCounter = NULL;&nbsp; /* Pointer to a word counter */<br />
&nbsp;printf(&quot;Calculating frequency of word occurances:\n&quot;);<br />
<span style="color:Green">gets(text);</span> <span style="color:Red">This line only gets the first line.&nbsp; To get the next I thought I could do something like footnote 1.</span><br />
<br />
/* Extract the words from the text&nbsp; */<br />
&nbsp;while(text[i] != '\0')<br />
&nbsp;{<br />
&nbsp; /* Skip over separators */<br />
&nbsp; while(is_separator(text[i]))<br />
&nbsp; ++i;<br />
&nbsp; /* It is either the end of the string or the start of a word&nbsp; &nbsp; */<br />
&nbsp; /* As long as it is not the string terminator copy the character */<br />
&nbsp; len = 0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /* Reset character count&nbsp; &nbsp; */<br />
&nbsp; while((!is_separator(text[i])) &amp;&amp; (text[i] != '\0'))<br />
&nbsp; buffer[len++] = text[i++];<br />
&nbsp; if(len&gt;0)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* Check we have some characters in the word */<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp;  buffer[len] = '\0';&nbsp;  /* We reached the end of a word so add terminator */<br />
&nbsp; &nbsp;  addWord(buffer);&nbsp; &nbsp; &nbsp; /* Add the word to the list */<br />
&nbsp; &nbsp; }<br />
&nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* List the words and their counts */<br />
&nbsp;pCounter = pStart;<br />
&nbsp;while(pCounter != NULL)<br />
&nbsp; {<br />
&nbsp;  show(pCounter);<br />
&nbsp;  pCounter = pCounter-&gt;pNext;<br />
&nbsp; }<br />
&nbsp;printf(&quot;\n&quot;);<br />
&nbsp;/* Free the memory that we allocated */<br />
&nbsp;pCounter = pStart;<br />
&nbsp;while(pCounter != NULL)<br />
&nbsp; {<br />
&nbsp;  free(pCounter-&gt;word);&nbsp; &nbsp; &nbsp; &nbsp; /* Free space for the word */<br />
&nbsp;  pStart = pCounter;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* Save address of current */<br />
&nbsp;  pCounter = pCounter-&gt;pNext;&nbsp; /* Move to next counter&nbsp; &nbsp; */<br />
&nbsp;  free(pStart);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /* Free space for current&nbsp; */<br />
&nbsp; }<br />
}<br />
<br />
/* Returns TRUE if the argument is a separator character and FALSE otherwise */<br />
int is_separator(char ch)<br />
{<br />
&nbsp;/* Separators are space, comma, colon, semicolon, double quote, question mark, exclamation, and period */<br />
&nbsp;static char separators[] = { ' ' , ',',':' , '\&quot;', '?' , '!' , '.'};<br />
&nbsp;int i = 0;<br />
&nbsp;for(i = 0 ; i&lt;sizeof separators ; i++)<br />
&nbsp; {<br />
&nbsp;  if(ch == separators[i])<br />
&nbsp;  return TRUE;<br />
&nbsp; }<br />
&nbsp;return FALSE;<br />
}<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; void show(struct WordCounter *pWordcounter)<br />
{<br />
&nbsp;/* output the word left-justified in a fixed field width followed by the count */<br />
&nbsp;printf(&quot;\n%-30s&nbsp;  %5d&quot;, pWordcounter-&gt;word,pWordcounter-&gt;word_count);<br />
}<br />
<br />
void addWord(char *word)<br />
{<br />
&nbsp;struct WordCounter *pCounter = NULL;<br />
&nbsp;struct WordCounter *pLast = NULL;<br />
&nbsp;if(pStart == NULL)<br />
&nbsp; {<br />
&nbsp;  pStart = createWordCounter(word);<br />
&nbsp;  return;<br />
&nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  /* If the word is in the list, increment its count */<br />
&nbsp;pCounter = pStart;<br />
&nbsp;while(pCounter != NULL)<br />
&nbsp; {<br />
&nbsp;  if(strcmp(word, pCounter-&gt;word) == 0)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp;  ++pCounter-&gt;word_count;<br />
&nbsp; &nbsp;  return;<br />
&nbsp; &nbsp; }<br />
&nbsp;  pLast = pCounter;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; /* Save address of last in case we need it */<br />
&nbsp;  pCounter = pCounter-&gt;pNext;&nbsp; /* Move pointer to next in the list&nbsp; &nbsp; &nbsp; &nbsp; */<br />
&nbsp; }<br />
<br />
&nbsp;/* If we get to here it's not in the list - so add it */<br />
&nbsp;  pLast-&gt;pNext = createWordCounter(word);<br />
}<br />
<br />
/* Create and returns a new WordCounter object for the argument */<br />
struct WordCounter* createWordCounter(char *word)<br />
{<br />
&nbsp; struct WordCounter *pCounter = NULL;<br />
&nbsp; pCounter = (struct WordCounter*)malloc(sizeof(struct WordCounter));<br />
&nbsp; pCounter-&gt;word = (char*)malloc(strlen(word)+1);<br />
&nbsp; strcpy(pCounter-&gt;word, word);<br />
&nbsp; pCounter-&gt;word_count = 1;<br />
&nbsp; pCounter-&gt;pNext = NULL;<br />
&nbsp; return pCounter;<br />
}</pre>1.  <pre style="margin:20px; line-height:13px">while(scanf(&quot;%s&quot;,&amp;text[x] != EOF))<br />
{<br />
gets(&amp;text[x]);<br />
x++;<br />
}</pre>However, C being the type dependent pain in the ass that it is...this doesn't work or I'm just unaware of how to cast it to work.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Ineedhelpplz</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239517.html</guid>
		</item>
		<item>
			<title>bios.h: No such file or directory</title>
			<link>http://www.daniweb.com/forums/thread239514.html</link>
			<pubDate>Wed, 18 Nov 2009 17:27:36 GMT</pubDate>
			<description><![CDATA[Hello, 
 
I'm trying to compile a program related with serial communication via RS232. I've found this program at microsoft page http://support.microsoft.com/?scid=kb%3Ben-us%3B39501&x=9&y=11#top. When I try to compile this same program in Dev C++ editor the following message appears:  
bios.h: No...]]></description>
			<content:encoded><![CDATA[<div>Hello,<br />
<br />
I'm trying to compile a program related with serial communication via RS232. I've found this program at microsoft page <a rel="nofollow" class="t" href="http://support.microsoft.com/?scid=kb%3Ben-us%3B39501&amp;x=9&amp;y=11#top" target="_blank">http://support.microsoft.com/?scid=k...1&amp;x=9&amp;y=11#top</a>. When I try to compile this same program in Dev C++ editor the following message appears: <br />
bios.h: No such file or directory. Please, help me about what can I do in order to advance or give me an alternative solution. Thanks in advance.<br />
 <pre style="margin:20px; line-height:13px">/* Compile options needed: none<br />
&nbsp;- The following program is a simple example which sends and receives<br />
&nbsp;  one character to/from COM1:<br />
*/ <br />
<br />
#include &lt;stdio.h&gt;<br />
#include &lt;bios.h&gt;<br />
<br />
void main(void)<br />
{<br />
&nbsp; &nbsp; unsigned com1_status;<br />
&nbsp; &nbsp; unsigned com1_send;<br />
&nbsp; &nbsp; unsigned com1_rec;<br />
&nbsp; &nbsp; unsigned com1_init;<br />
&nbsp; &nbsp; int result, mask;<br />
<br />
&nbsp; &nbsp; /* open serial port at 1200 baud, 8 data bits,<br />
&nbsp; &nbsp; ** No parity, 1 stop bit */ <br />
&nbsp; &nbsp; com1_init = _bios_serialcom(_COM_INIT, 0,<br />
&nbsp; &nbsp; &nbsp; &nbsp; _COM_CHR8 | _COM_NOPARITY | _COM_STOP1 | _COM_1200);<br />
&nbsp; &nbsp; printf(&quot;Init status: 0x%4.4X\n&quot;, com1_init);<br />
<br />
&nbsp; &nbsp; /* send an '*' to com1 */ <br />
&nbsp; &nbsp; com1_send = _bios_serialcom(_COM_SEND, 0, '*');<br />
&nbsp; &nbsp; printf(&quot;Send status: 0x%4.4X\n&quot;, com1_send);<br />
<br />
&nbsp; &nbsp; mask = 0x6100;<br />
&nbsp; &nbsp; /* value used to mask:<br />
&nbsp; &nbsp; *&nbsp; &nbsp; bits 0-7 are related to modems,<br />
&nbsp; &nbsp; *&nbsp; &nbsp; bits 8-15 are for port status,<br />
&nbsp; &nbsp; *&nbsp; &nbsp; &nbsp; check to see that the following bits are set:<br />
&nbsp; &nbsp; *&nbsp; &nbsp; &nbsp; &nbsp;  8 (data ready)<br />
&nbsp; &nbsp; *&nbsp; &nbsp; &nbsp; &nbsp; 13 (Transmission-hold&nbsp; register empty)<br />
&nbsp; &nbsp; *&nbsp; &nbsp; &nbsp; &nbsp; 14 (Transmission-shift register empty)<br />
&nbsp; &nbsp; */ <br />
<br />
&nbsp; &nbsp; /* check the status */ <br />
&nbsp; &nbsp; com1_status = _bios_serialcom(_COM_STATUS, 0, 0);<br />
&nbsp; &nbsp; printf(&quot;COM1 status: 0x%4.4X\n&quot;, com1_status);<br />
<br />
&nbsp; &nbsp; /* wait until a character is ready */ <br />
&nbsp; &nbsp; do {<br />
&nbsp; &nbsp; &nbsp; &nbsp; /* check the status */ <br />
&nbsp; &nbsp; &nbsp; &nbsp; com1_status = _bios_serialcom(_COM_STATUS, 0, 0);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; /* mask off the low order byte of com1_status */ <br />
&nbsp; &nbsp; &nbsp; &nbsp; com1_status = com1_status &amp; 0xFF00;<br />
&nbsp; &nbsp; } while( (mask &amp; com1_status) == 0);<br />
<br />
&nbsp; &nbsp; /* get a character */ <br />
&nbsp; &nbsp; com1_rec =&nbsp; _bios_serialcom(_COM_RECEIVE, 0, 0);<br />
&nbsp; &nbsp; printf(&quot;Read status: 0x%4.4X\n&quot;, com1_rec);<br />
<br />
&nbsp; &nbsp; /* print the character we just received */ <br />
&nbsp; &nbsp; result = com1_rec &amp; 0x00FF;<br />
&nbsp; &nbsp; printf(&quot;Character: 0x%2.2X&nbsp; =&nbsp; %c\n&quot;, result, (char)result);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>jmangu</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239514.html</guid>
		</item>
		<item>
			<title>Dynamic include in C</title>
			<link>http://www.daniweb.com/forums/thread239511.html</link>
			<pubDate>Wed, 18 Nov 2009 17:17:29 GMT</pubDate>
			<description><![CDATA[Hi All, 
Let me explain the problem. 
 
I have multiple include files as in class1.inc, class2.inc, class3.inc etc. Contents of an include file will be like 
 
class1.inc 
 
 
{ 
"john",]]></description>
			<content:encoded><![CDATA[<div>Hi All,<br />
Let me explain the problem.<br />
<br />
I have multiple include files as in class1.inc, class2.inc, class3.inc etc. Contents of an include file will be like<br />
<br />
class1.inc<br />
<br />
 <pre style="margin:20px; line-height:13px">{<br />
&quot;john&quot;,<br />
12,<br />
68,<br />
<br />
&quot;steve&quot;,<br />
12,<br />
98,<br />
<br />
&quot;mat&quot;,<br />
12,<br />
95,<br />
<br />
};</pre><br />
This will basically serve as a static array of structures. Here there are three field name(char*), age(int), avg(float).<br />
In my program I want to assign the value of one of these file to a structure variable. My code goes like this<br />
<br />
 <pre style="margin:20px; line-height:13px">struct std_<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char name&#91;50&#93;;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int age;<br />
&nbsp; &nbsp; &nbsp; &nbsp; float avg;<br />
}<br />
std_str, *std_ptr;<br />
<br />
int main(int argc, char **argv)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; if(!strcmp(argv&#91;2&#93;,&quot;class1&quot;)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; static std_str obj&#91;200&#93; = <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; #include &quot;class1.inc&quot;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ...<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if(!strcmp(argv&#91;2&#93;,&quot;class2&quot;)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ...&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
return 0;<br />
}</pre><br />
The above code will work fine. But what I want is<br />
 <pre style="margin:20px; line-height:13px">int main(int argc, char **argv)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char file&#91;50&#93;;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; /* I want to dynamically generate the include file name and include it */<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcat(file, argv&#91;2&#93;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcat(file, &quot;.inc&quot;)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; static std_str obj&#91;200&#93; = <br />
&nbsp; &nbsp; &nbsp; &nbsp; #include file<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
return 0;<br />
}</pre><br />
But unfortunately, the compilation fails, saying #include expects a file name.<br />
<br />
Is there anyway to achieve this?<br />
<br />
Thanks and Regards,<br />
Ahamed.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>ahamed101</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239511.html</guid>
		</item>
		<item>
			<title>Asynchronous Server with threads</title>
			<link>http://www.daniweb.com/forums/thread239449.html</link>
			<pubDate>Wed, 18 Nov 2009 13:20:46 GMT</pubDate>
			<description><![CDATA[I'm trying to create a simple server that starts a new thread for each new client that connects. I know I can use fork(), but I've heard that threads are more efficient. Also I have some global queues, so if I used fork(), each process would get their own version of the queues. (I could fix this...]]></description>
			<content:encoded><![CDATA[<div>I'm trying to create a simple server that starts a new thread for each new client that connects. I know I can use fork(), but I've heard that threads are more efficient. Also I have some global queues, so if I used fork(), each process would get their own version of the queues. (I could fix this with shared memory).<br />
<br />
But I'm not sure where to implement this in my code.<br />
Heres the pseudocode of my server and main accept() loop:<br />
<br />
 <pre style="margin:20px; line-height:13px">Global queue1;<br />
Global queue2;<br />
<br />
&lt;create socket and request socket, fill address structure, bind(), listen()&gt;<br />
while(1) {<br />
&nbsp; &nbsp; &lt;socket = accept()&gt;<br />
&nbsp; &nbsp; &lt;close request socket&gt;<br />
&nbsp; &nbsp; &lt;Processing the request&gt;<br />
&nbsp; &nbsp; &lt;Closing socket&gt;<br />
}</pre><br />
So I need to know where/how, in my code, to implement threads, and which type of threads to use. It is supposed to run on Linux. <br />
Also I need to know how to synchronize Global queue1 and Global queue2 so that the threads can access and write/delete from them without problems.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>siggivara</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239449.html</guid>
		</item>
		<item>
			<title>How to output all the letters of the alphabet randomly?</title>
			<link>http://www.daniweb.com/forums/thread239425.html</link>
			<pubDate>Wed, 18 Nov 2009 11:01:40 GMT</pubDate>
			<description><![CDATA[Hello people :) 
 
My teacher gave me a new project to work on. 
I need to write an application that output all the letters of the alphabet  in a random order. 
I've made some applications before but im still kinda new to this. 
Could any of you give me a hint or put me in the right direction? 
...]]></description>
			<content:encoded><![CDATA[<div>Hello people :)<br />
<br />
My teacher gave me a new project to work on.<br />
I need to write an application that output all the letters of the alphabet  in a random order.<br />
I've made some applications before but im still kinda new to this.<br />
Could any of you give me a hint or put me in the right direction?<br />
<br />
Kind regards,<br />
Jelmund<br />
<br />
PS: i already searched on the internet</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Jelmund</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239425.html</guid>
		</item>
		<item>
			<title>Socket programming in C</title>
			<link>http://www.daniweb.com/forums/thread239156.html</link>
			<pubDate>Tue, 17 Nov 2009 08:11:30 GMT</pubDate>
			<description>Hi all, 
How to do socket programming in C.I need to control an external device through TCP/IP or UDP/IP so that when I send a query the device should  be capable to respond.</description>
			<content:encoded><![CDATA[<div>Hi all,<br />
How to do socket programming in C.I need to control an external device through TCP/IP or UDP/IP so that when I send a query the device should  be capable to respond.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>george_82</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239156.html</guid>
		</item>
		<item>
			<title>Interrupts in C</title>
			<link>http://www.daniweb.com/forums/thread239110.html</link>
			<pubDate>Tue, 17 Nov 2009 04:26:57 GMT</pubDate>
			<description><![CDATA[Dear colleagues I am currently working on designing a scheduler using Borland C. I am struck with the concept of interrupts. I am trying clock tick interrupt for task switching. In all materials they say you will continue to your regular job until the interrupt occurs. I don't think it suddenly...]]></description>
			<content:encoded><![CDATA[<div>Dear colleagues I am currently working on designing a scheduler using Borland C. I am struck with the concept of interrupts. I am trying clock tick interrupt for task switching. In all materials they say you will continue to your regular job until the interrupt occurs. I don't think it suddenly occurs with out setting it in the context of the task. this is my first project in C. currently my tasks don't have separate stack of their own. all share the same stack. so i will be happy if you people tell me in what way i should update my knowledge.<br />
in my part i will help to you people too.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Mathura</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239110.html</guid>
		</item>
		<item>
			<title><![CDATA[find the 3rd ',' in a string line]]></title>
			<link>http://www.daniweb.com/forums/thread239083.html</link>
			<pubDate>Tue, 17 Nov 2009 02:08:46 GMT</pubDate>
			<description><![CDATA[Hi experts, 
 
i have this line of string: a1,b2,c3,a2,b1,c2,a3,b2,c4, 
 
from this line,i want to load into a string array like this: 
array[0]=a1,b2,c3, 
array[1]=a2,b1,c2, 
array[3]=a3,b2,c4, 
 
seriously i have no idea at all.ive done sumthing but looks like rubbish.i really hope dat u experts...]]></description>
			<content:encoded><![CDATA[<div>Hi experts,<br />
<br />
i have this line of string: a1,b2,c3,a2,b1,c2,a3,b2,c4,<br />
<br />
from this line,i want to load into a string array like this:<br />
array[0]=a1,b2,c3,<br />
array[1]=a2,b1,c2,<br />
array[3]=a3,b2,c4,<br />
<br />
seriously i have no idea at all.ive done sumthing but looks like rubbish.i really hope dat u experts can help me.<br />
<br />
thanks for advance<br />
 <pre style="margin:20px; line-height:13px">void seeding()<br />
{<br />
&nbsp;  char seed_array[100];//line of characters in this array<br />
&nbsp;  printf (&quot;seed real=&gt; %s\n&quot;,seed);<br />
&nbsp;  char *p=NULL;<br />
<br />
&nbsp;  for (int i=0;i&lt;= 100;i++)<br />
&nbsp;  {<br />
&nbsp; &nbsp; &nbsp;  p=strchr(seed,',');<br />
&nbsp; &nbsp; &nbsp;  if (atoi(p)==3)<br />
&nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcpy (seed_array[i],p);<br />
&nbsp; &nbsp; &nbsp; &nbsp; *p='\n';<br />
&nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp;  printf (&quot;seed array=&gt; %s\n&quot;,seed_array[i]);<br />
&nbsp;  }<br />
<br />
&nbsp;  printf(&quot;seeding test is running!!!!\n&quot;);<br />
&nbsp;}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>ubi_ct83</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239083.html</guid>
		</item>
		<item>
			<title>Starting out using structures . . .</title>
			<link>http://www.daniweb.com/forums/thread239007.html</link>
			<pubDate>Mon, 16 Nov 2009 19:05:26 GMT</pubDate>
			<description><![CDATA[<div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C Syntax</strong> (<a...]]></description>
			<content:encoded><![CDATA[<div> <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
<br />
struct poly {<br />
&nbsp; &nbsp; &nbsp; &nbsp; int len;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int arr[];<br />
&nbsp; &nbsp; &nbsp; &nbsp; char *name;<br />
};<br />
<br />
<br />
int main() {<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; struct poly p;<br />
&nbsp; &nbsp; &nbsp; &nbsp; p.len = 45;<br />
&nbsp; &nbsp; &nbsp; &nbsp; p.arr[3] = {1,1,1};<br />
&nbsp; &nbsp; &nbsp; &nbsp; p.name = &quot;Josh&quot;;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&quot;,p.len);<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i = 0; p.arr[i] != NULL ; i++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%d&quot;,p.arr[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%s&quot;,p.name);<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre><br />
I tried to make a simple program to see if I understood structures. Apparently, I do not. Haha.<br />
<br />
I am getting these error messages when I compile:<br />
struct.c:5: error: flexible array member not at end of struct<br />
struct.c: In function âmainâ:<br />
struct.c:14: error: expected expression before â{â token<br />
<br />
Does anyone mind helping me learn what I did wrong and how to fix it?<br />
<br />
Thank you!</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Soileau</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread239007.html</guid>
		</item>
		<item>
			<title>What is the correct o/p for the following code?</title>
			<link>http://www.daniweb.com/forums/thread238989.html</link>
			<pubDate>Mon, 16 Nov 2009 17:56:02 GMT</pubDate>
			<description><![CDATA[<div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C Syntax</strong> (<a...]]></description>
			<content:encoded><![CDATA[<div> <pre style="margin:20px; line-height:13px">include&lt;stdio.h&gt;<br />
void main()<br />
{<br />
int i=5;<br />
int c;<br />
c=i++ + ++i + i++ + --i;<br />
printf(&quot;\n%d&quot;,i++ + ++i + i++ + --i);<br />
printf(&quot;\n%d&quot;,c);<br />
}</pre>The o/p that I'm getting is <br />
31<br />
23<br />
<br />
while my friend got<br />
34<br />
20.<br />
<br />
<br />
Also why are the 2 (printf ' c 'and printf 'expression') values different. Is it because printf evaluation is different from how a normal expression would be evaluated?<br />
<br />
thanks in advance.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>userits</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238989.html</guid>
		</item>
		<item>
			<title>Avegare number of comparisons</title>
			<link>http://www.daniweb.com/forums/thread238960.html</link>
			<pubDate>Mon, 16 Nov 2009 15:41:41 GMT</pubDate>
			<description><![CDATA[Hello, 
 
I have a program which searches for  (using binary search) specific word in ordered list and counts number of comparisons it makes until it finds the target!  
 
My problem is: how can I count average of number of comparisons? 
 
Here is how searching function works: 
 
  <div...]]></description>
			<content:encoded><![CDATA[<div>Hello,<br />
<br />
I have a program which searches for  (using binary search) specific word in ordered list and counts number of comparisons it makes until it finds the target! <br />
<br />
My problem is: how can I count average of number of comparisons?<br />
<br />
Here is how searching function works:<br />
<br />
 <pre style="margin:20px; line-height:13px">int binary_search(char *array[], int end, char *target, int *location, int *compare_count){<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; int first;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int middle;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int last;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; first = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; last = end;<br />
&nbsp; &nbsp; &nbsp; &nbsp; *compare_count = 0;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; while(first &lt;= last){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; middle = (first + last)/2;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(strcmp(array[middle], target) &lt; 0){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; first = middle + 1;;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if(strcmp(array[middle], target) &gt; 0){<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; last = middle - 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (*compare_count)++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; *location = middle; <br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; if(first == last) first--;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return(strcmp(target, array[middle]) == 0);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>timaquerra</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238960.html</guid>
		</item>
		<item>
			<title>Winsock hooks</title>
			<link>http://www.daniweb.com/forums/thread238956.html</link>
			<pubDate>Mon, 16 Nov 2009 15:34:14 GMT</pubDate>
			<description><![CDATA[I'm looking for code to inject code into a webpage at the specified location. Can we do this using winsock hooks.  
Can somebody help me with this. I need this urgently:confused:]]></description>
			<content:encoded><![CDATA[<div>I'm looking for code to inject code into a webpage at the specified location. Can we do this using winsock hooks. <br />
Can somebody help me with this. I need this urgently:confused:</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>lacompsr</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238956.html</guid>
		</item>
		<item>
			<title>Homework: parking problem</title>
			<link>http://www.daniweb.com/forums/thread238943.html</link>
			<pubDate>Mon, 16 Nov 2009 14:25:13 GMT</pubDate>
			<description><![CDATA[im new at C, actually just started programming in general, and im having a good amount of problems with this program. 
 
#include <stdio.h> 
 
 
 
int main(void) 
 
{ 
char vehicle;]]></description>
			<content:encoded><![CDATA[<div>im new at C, actually just started programming in general, and im having a good amount of problems with this program.<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
<br />
<br />
<br />
int main(void)<br />
<br />
{<br />
char vehicle;<br />
char car;<br />
char truck;<br />
int hrsn, minn;<br />
int hrso, mino;<br />
int time;<br />
int rt;<br />
int amo;<br />
<br />
printf(&quot;What time did you park(military time-(hh,mm))?&quot;);<br />
scanf(&quot;%d,%d&quot;, &amp;hrsn, &amp;minn);<br />
<br />
printf(&quot;What time did you leave(military time-(hh,mm))?&quot;);<br />
scanf(&quot;%d,%d&quot;, &amp;hrso, &amp;mino);<br />
<br />
printf(&quot;Where you driving a car or truck?&quot;);<br />
scanf(&quot;%c&quot;, &amp;vehicle );<br />
<br />
if (hrsn &lt; (hrso - 1) &amp;&amp; minn &gt; mino)<br />
{ hrso = hrso - 1;<br />
mino = mino + 60;<br />
}<br />
if (mino - minn &gt; 1 &amp;&amp; mino - minn &lt; 30)<br />
{<br />
mino - minn = 30;<br />
}<br />
<br />
else if (mino - minn &gt; 30 &amp;&amp; mino - minn &lt; 60)<br />
{<br />
mino - minn = 60;<br />
}<br />
<br />
else {<br />
mino - minn = 00;<br />
}<br />
<br />
rt = hrso - hrsn:mino - minn;<br />
<br />
if (vehicle == car)<br />
{ scanf(&quot;%c&quot;, &amp;car);<br />
if (time &lt; 3)<br />
{car = 0;<br />
}<br />
else<br />
{car = 1.5;<br />
}<br />
}<br />
<br />
<br />
else {<br />
scanf(&quot;%c&quot;, &amp;truck):<br />
if (time &lt; 2)<br />
{truck = 1;<br />
}<br />
else<br />
{truck = 2.3;<br />
}<br />
}<br />
amo = rt * %c;<br />
<br />
<br />
<br />
}<br />
printf(&quot;%c&quot;);<br />
Printf(&quot;Time in %d:%d\n&quot;, hrsn, minn);<br />
Printf(&quot;Time out %d:%d\n&quot;, hrso, mino);<br />
<br />
printf(&quot;Parking Time %d\n&quot;, time);<br />
printf(&quot;Rounded time %d\n&quot;, rt);<br />
<br />
printf(&quot;Ammount Owed $ %d\n&quot;, amo);<br />
<br />
<br />
return 0;<br />
<br />
<br />
}</pre><br />
im trying to do this:<br />
<br />
Problem 2: (P) Write a C program to calculate the parking fare for customers who park their cars in a parking lot when the following information is given:<br />
a. A character showing the type of vehicle: C for car, T for truck.<br />
b. An integcr between 0 and 24 showing the hour the vehicle entered the lot.<br />
c. An integer between 0 and 60 showing the minute the vehicle entered the lot.<br />
d. An integer between 0 and 24 showing the hour the vehicle left the lot.<br />
e. An integer between 0 and 60 showing the minute the vehicle left the lot.<br />
This is a public lot. To encourage people to park for a short period of time, the management uses two different rates for each type of vehicle, as shown in Table<br />
CAR $0 / hr first 3 hr $1.50 / hr after 3 hr<br />
TRUCK $1 / hr first 2 hr $2.30 / hr after 2 hr<br />
Input data consists of a character and a set of four integers. The character represents type of vehicle and the four integers indicate: Hour entered the lot, Minute entered lot, Hour exited lot, and Minute exited the lot. <br />
<br />
Output should be like:<br />
<br />
Type of vehicle: &lt;car , bus, or truck&gt;<br />
TIME-IN HR:MN<br />
TIME-OUT HR:MN<br />
----------<br />
PARKING TIME HR:MN<br />
ROUNDED TIME HOURS<br />
<br />
TOTAL CHARGE $ _____.__<br />
<br />
<br />
im sure there are alot of mistakes<br />
any help is greatly appriciated</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>Hanyack</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238943.html</guid>
		</item>
		<item>
			<title>problem in passing strings from array of atring</title>
			<link>http://www.daniweb.com/forums/thread238886.html</link>
			<pubDate>Mon, 16 Nov 2009 10:22:15 GMT</pubDate>
			<description>i have a problem in which i have to remove char from strings by sending one string and char ata time to a function. 
in the below code it works fine for first string but for each successive string initial characters are not passed ..like for second call first chatcter of string will not be passed...</description>
			<content:encoded><![CDATA[<div>i have a problem in which i have to remove char from strings by sending one string and char ata time to a function.<br />
in the below code it works fine for first string but for each successive string initial characters are not passed ..like for second call first chatcter of string will not be passed and so on.<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;string.h&gt;<br />
<br />
#define MAXLEN 100<br />
void fnRemChar(char*,char);<br />
int main(int argc,char *argv&#91;&#93;)<br />
{<br />
<br />
&nbsp; &nbsp; system(&quot;clear&quot;);<br />
&nbsp; &nbsp; int iNoOfStr;<br />
&nbsp; &nbsp; char acInpStr&#91;MAXLEN&#93;&#91;MAXLEN&#93;;<br />
&nbsp; &nbsp; char cChar;<br />
&nbsp; &nbsp; printf(&quot;\nEnter number of strings to be entered(should not be greater than %d):&quot;,MAXLEN);<br />
&nbsp; &nbsp; fflush(stdin);<br />
&nbsp; &nbsp; scanf(&quot;%d&quot;,&amp;iNoOfStr);<br />
&nbsp; &nbsp; void (*REMOVE) (char* ,char);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; /* REMOVE Pointer to Function fnRemChar */<br />
&nbsp; &nbsp; &nbsp; &nbsp; REMOVE = fnRemChar;<br />
<br />
&nbsp; &nbsp; for(int iCount=0;iCount&lt;iNoOfStr;iCount++)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n ENTER %d String: &quot;,iCount+1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; getchar();<br />
&nbsp; &nbsp; &nbsp; &nbsp; fgets(acInpStr&#91;iCount&#93;,MAXLEN,stdin);<br />
&nbsp; &nbsp; &nbsp; &nbsp; fflush(stdout);<br />
&nbsp; &nbsp; &nbsp; &nbsp; fflush(stdin);<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; printf(&quot;\n Enter character to be removed: &quot;);<br />
&nbsp; &nbsp; scanf(&quot;%c&quot;,&amp;cChar);<br />
<br />
&nbsp; &nbsp; for(int iCount=0;iCount&lt;iNoOfStr;iCount++)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; REMOVE(acInpStr&#91;iCount&#93;,cChar);<br />
&nbsp; &nbsp; }<br />
}<br />
void fnRemChar(char *acInpStr,char cChar)<br />
{<br />
&nbsp; &nbsp; char acFinalStr&#91;MAXLEN&#93;;<br />
&nbsp; &nbsp; int iCount=0,iCount1=0;<br />
&nbsp; &nbsp; while(acInpStr&#91;iCount&#93;!='\0')<br />
&nbsp;if(acInpStr&#91;iCount&#93; != cChar)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n %c&quot;,acInpStr&#91;iCount&#93;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; acFinalStr&#91;iCount1&#93;=acInpStr&#91;iCount&#93;;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; iCount1++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; iCount++;<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; printf(&quot;\n %s\n&quot;,acFinalStr);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>arsh_arsh</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238886.html</guid>
		</item>
		<item>
			<title>about recursion</title>
			<link>http://www.daniweb.com/forums/thread238874.html</link>
			<pubDate>Mon, 16 Nov 2009 09:17:23 GMT</pubDate>
			<description>helllo  
last day i did program related to recursion that is factorial of numbers i red lot of books in my library but i found only this program only in every book. 
i also thought lot on recursion but i did not find any more program please can anybody tell me or can give any clue to do more...</description>
			<content:encoded><![CDATA[<div>helllo <br />
last day i did program related to recursion that is factorial of numbers i red lot of books in my library but i found only this program only in every book.<br />
i also thought lot on recursion but i did not find any more program please can anybody tell me or can give any clue to do more programs by using this concept.<br />
i do not want program coding i just want question on it or any clue<br />
please help me.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>aman rathi</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238874.html</guid>
		</item>
		<item>
			<title>about pointers</title>
			<link>http://www.daniweb.com/forums/thread238871.html</link>
			<pubDate>Mon, 16 Nov 2009 09:01:06 GMT</pubDate>
			<description>hello  
i am a student of sgrrits dehradun doing bca now a days my pointers chapter is going on its difficult to understand but mostly i did it but i want to know that how it is use ful for us in the c. 
i only find its 1 benefit that is by using pointers you can return two or more values in a...</description>
			<content:encoded><![CDATA[<div>hello <br />
i am a student of sgrrits dehradun doing bca now a days my pointers chapter is going on its difficult to understand but mostly i did it but i want to know that how it is use ful for us in the c.<br />
i only find its 1 benefit that is by using pointers you can return two or more values in a function.<br />
please can anybody tell how it is more useful for us and what are that programs that can be excutes by using only pointers?<br />
please also tell me any site or give me any link where i find lot of lot clues to do programs by using pointer.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>aman rathi</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238871.html</guid>
		</item>
		<item>
			<title>Code or function for key press like mouse button press</title>
			<link>http://www.daniweb.com/forums/thread238867.html</link>
			<pubDate>Mon, 16 Nov 2009 08:29:37 GMT</pubDate>
			<description><![CDATA[Hi, 
 
Is there a way to write code or do functions exist for keypress down and keypress up of the keyboard.There are functions for mouseleft button down and mouse left button up.Is it possible with keyboard keys in windows?Like "Alt"+"F" etc... 
 
Any sample code or resource would greatly...]]></description>
			<content:encoded><![CDATA[<div>Hi,<br />
<br />
Is there a way to write code or do functions exist for keypress down and keypress up of the keyboard.There are functions for mouseleft button down and mouse left button up.Is it possible with keyboard keys in windows?Like &quot;Alt&quot;+&quot;F&quot; etc...<br />
<br />
Any sample code or resource would greatly help.Thanks in advance.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>danibootstrap</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238867.html</guid>
		</item>
		<item>
			<title>Serial port reading error</title>
			<link>http://www.daniweb.com/forums/thread238853.html</link>
			<pubDate>Mon, 16 Nov 2009 07:18:48 GMT</pubDate>
			<description><![CDATA[//The below mentioned code is not working on my C compiler.The //errors im getting  is :(1)Extra parameter in call to_ inport b_. 
//(2)Too few parameters in call to "outport".(line 25) 
//(3)Not an allowed type(line 25) 
 
 
#include<stdio.h> 
#include<conio.h> 
#include<dos.h> 
 
void main()]]></description>
			<content:encoded><![CDATA[<div>//The below mentioned code is not working on my C compiler.The //errors im getting  is :(1)Extra parameter in call to_ inport b_.<br />
//(2)Too few parameters in call to &quot;outport&quot;.(line 25)<br />
//(3)Not an allowed type(line 25)<br />
<br />
 <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
#include&lt;conio.h&gt;<br />
#include&lt;dos.h&gt;<br />
<br />
void main()<br />
&nbsp; {<br />
&nbsp; &nbsp; char data;<br />
&nbsp; &nbsp; int choice;<br />
&nbsp; &nbsp; clrscr();<br />
<br />
&nbsp; printf(&quot;Enter the choice to send or receive from COM1::&quot;);<br />
&nbsp; scanf(&quot;%d&quot;,&amp;choice);<br />
<br />
<br />
&nbsp; if(choice==1)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; printf(&quot;Enter data to send::&quot;);<br />
&nbsp; &nbsp; &nbsp; scanf(&quot;%c&quot;,data);<br />
&nbsp; &nbsp; &nbsp; inportb(0x03f8,data);<br />
&nbsp; &nbsp; }<br />
<br />
<br />
&nbsp; else<br />
&nbsp; &nbsp; {<br />
data=outport(0x3f8);<br />
printf(&quot;reding from&nbsp; COM1::%d&quot;,data);<br />
<br />
&nbsp; &nbsp; }<br />
getch();<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>george_82</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238853.html</guid>
		</item>
		<item>
			<title>put void function into loop statement?</title>
			<link>http://www.daniweb.com/forums/thread238836.html</link>
			<pubDate>Mon, 16 Nov 2009 05:14:33 GMT</pubDate>
			<description>is it possible to put void function into loop statement?</description>
			<content:encoded><![CDATA[<div>is it possible to put void function into loop statement?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>timaquerra</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238836.html</guid>
		</item>
		<item>
			<title>Calendar in C program using julian dates</title>
			<link>http://www.daniweb.com/forums/thread238825.html</link>
			<pubDate>Mon, 16 Nov 2009 04:21:44 GMT</pubDate>
			<description><![CDATA[I need help understanding julian dates. 
I am trying to create a program using julian dates where user enters month & year and show the calendar of that month. 
I especially don't understand the "int toJulian()"... 
 
here is what I have so far: 
 
  <div class="codeblock"> <div class="spaced">...]]></description>
			<content:encoded><![CDATA[<div>I need help understanding julian dates.<br />
I am trying to create a program using julian dates where user enters month &amp; year and show the calendar of that month.<br />
I especially don't understand the &quot;int toJulian()&quot;...<br />
<br />
here is what I have so far:<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#define START 1900 //fixed year<br />
<br />
//PROTOTYPES here<br />
<br />
void main(void)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int day, month, year, startDay, numDays;<br />
&nbsp; &nbsp; &nbsp; &nbsp; numDays = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; startDay = 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; day = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; getMonthYear(&amp;month, &amp;year);<br />
&nbsp; &nbsp; &nbsp; &nbsp; toJulian(month, day, year);<br />
&nbsp; &nbsp; &nbsp; &nbsp; yearsToDays(year);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printCalendar(startDay, numDays);<br />
}<br />
void getMonthYear(int *month, int *year)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Enter month: &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf_s(&quot;%d&quot;, month);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Enter year: &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf_s(&quot;%d&quot;, year);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n&quot;); <br />
<br />
}<br />
int toJulian(int month, int day, int year) //takes calendar date and calculates its julian day within the year<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int count;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(count = 1; count &lt; month; ++count)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; day =+ daysInMonth(month, year);<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
}<br />
int daysInMonth(int month, int year) //takes a month and year and calculates how many days are in this particular month<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int numDays;<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (month == 1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 2)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 28 + leapYear(year);<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 3)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 4)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 30;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 5)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 6)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 30;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 7)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 8)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 9)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 30;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 10)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 11)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 30;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (month == 12)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; numDays = 31;<br />
}<br />
int leapYear(int year) //takes year and returns 1 if leap year otherwise 0<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (year % 400 == 0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}<br />
long yearsToDays(int year) // takes year returns the number of days from 1/1/1900 to end of previous year.<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int count;<br />
&nbsp; &nbsp; &nbsp; &nbsp; long days;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(count = START; count &lt; year; ++count)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; days = 365 + leapYear(year);<br />
}<br />
void printCalendar(int startDay, int numDays)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int num, dayid;<br />
&nbsp; &nbsp; &nbsp; &nbsp; printHeader();<br />
<br />
}<br />
void printHeader()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;SUN MON TUE WED THU FRI SAT\n&quot;);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>julie_kaz</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238825.html</guid>
		</item>
		<item>
			<title>need help with pointers</title>
			<link>http://www.daniweb.com/forums/thread238811.html</link>
			<pubDate>Mon, 16 Nov 2009 03:24:23 GMT</pubDate>
			<description><![CDATA[Hi 
i'm trying to compile this code, but getting warning. need some help to understand what I'm doing wrong. 
 
void printGraph(FILE *out, GraphRef G){ 
 
  out = fopen (out, "w"); 
  if( out==NULL ){ 
      printf("Unable to open file %s for writing\n", out); 
      exit(1); 
   }]]></description>
			<content:encoded><![CDATA[<div>Hi<br />
i'm trying to compile this code, but getting warning. need some help to understand what I'm doing wrong.<br />
<br />
void printGraph(FILE *out, GraphRef G){<br />
<br />
  out = fopen (out, &quot;w&quot;);<br />
  if( out==NULL ){<br />
      printf(&quot;Unable to open file %s for writing\n&quot;, out);<br />
      exit(1);<br />
   }<br />
}<br />
<br />
warning: passing arg 1 of `fopen' from incompatible pointer type</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>hosh</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238811.html</guid>
		</item>
		<item>
			<title>Code Snippet fseeko64() and ftello64() for deal with large files (eg. file dimension)</title>
			<link>http://www.daniweb.com/code/snippet238780.html</link>
			<pubDate>Sun, 15 Nov 2009 23:39:01 GMT</pubDate>
			<description><![CDATA[*fseek()* and *ftell()* work only for files < 2,147,483,647 bytes 
 
*fseeko64()* and *ftello64()* from *<stdio.h>* can deal with files up to 18,446,744,073,709,552,000 bytes 
 
the printf format for unsigned long long val is *%I64d* 
 
eg. Obtaining the file dimension  (this code was tested with...]]></description>
			<content:encoded><![CDATA[<div><span style="font-weight:bold">fseek()</span> and <span style="font-weight:bold">ftell()</span> work only for files &lt; 2,147,483,647 bytes<br />
<br />
<span style="font-weight:bold">fseeko64()</span> and <span style="font-weight:bold">ftello64()</span> from <span style="font-weight:bold">&lt;stdio.h&gt;</span> can deal with files up to 18,446,744,073,709,552,000 bytes<br />
<br />
the printf format for unsigned long long val is <span style="font-weight:bold">%I64d</span><br />
<br />
eg. Obtaining the file dimension  (this code was tested with <span style="font-weight:bold">GNU GCC compiler</span> (MinGW/Cygwin) from code::blocks)</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>AuSsIeStOnE</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238780.html</guid>
		</item>
		<item>
			<title>stdio.h function body</title>
			<link>http://www.daniweb.com/forums/thread238737.html</link>
			<pubDate>Sun, 15 Nov 2009 19:14:01 GMT</pubDate>
			<description>stdio.h only includes function declarations. Where does the compiler look for the function bodies?</description>
			<content:encoded><![CDATA[<div>stdio.h only includes function declarations. Where does the compiler look for the function bodies?</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>ybean4</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238737.html</guid>
		</item>
		<item>
			<title>Weird characters with char pointer</title>
			<link>http://www.daniweb.com/forums/thread238672.html</link>
			<pubDate>Sun, 15 Nov 2009 16:18:22 GMT</pubDate>
			<description><![CDATA[Hi, i'm facing a weird behavior in this code that i just wrote. It was supposed to read a string from stdin and just write it out. 
I've debugged it and for me it reads perfectly, but in the while (line 38), *p just seems to be taking weird chars although it's pointing to the correct mem address...]]></description>
			<content:encoded><![CDATA[<div>Hi, i'm facing a weird behavior in this code that i just wrote. It was supposed to read a string from stdin and just write it out.<br />
I've debugged it and for me it reads perfectly, but in the while (line 38), *p just seems to be taking weird chars although it's pointing to the correct mem address (checked with those printf i put).<br />
What's going on?<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#define LONG 100<br />
<br />
char * leer();<br />
void printar(char *);<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; printf(&quot;Insert a string: &quot;);<br />
&nbsp; &nbsp; //char *str = leer();<br />
&nbsp; &nbsp; printar(leer());<br />
&nbsp; &nbsp; return 0;<br />
}<br />
<br />
char * leer()<br />
{<br />
&nbsp; &nbsp; char str[LONG], *p;<br />
&nbsp; &nbsp; int c;<br />
&nbsp; &nbsp; p = str;<br />
<br />
&nbsp; &nbsp; while((c = getchar()) != EOF)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(c == '\n')<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; *p = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; *p = c;<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;p = %p, *p = c = %c\n&quot;, p, *p);<br />
&nbsp; &nbsp; &nbsp; &nbsp; p++;<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; return str;<br />
}<br />
<br />
void printar(char *str)<br />
{<br />
&nbsp; &nbsp; char *p = str;<br />
&nbsp; &nbsp; while(*p != 0)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;p = %p, *p = %c\n&quot;, p, *p);<br />
&nbsp; &nbsp; &nbsp; &nbsp; putchar(*p);<br />
&nbsp; &nbsp; &nbsp; &nbsp; p++;<br />
&nbsp; &nbsp; }<br />
<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>neithan</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238672.html</guid>
		</item>
		<item>
			<title>Help with a network design problem</title>
			<link>http://www.daniweb.com/forums/thread238669.html</link>
			<pubDate>Sun, 15 Nov 2009 15:47:35 GMT</pubDate>
			<description><![CDATA[Hello All! 
 
I have been working on a network design problem and am having a problem in the following part- 
 
What I am trying to do here -- 
{ 
for every set of edges (a,b), 
{ for all arcs (l,m) 
assign length of -- arc [l,m] = edge [a,b][l,m] 
shortest_path (num_nodes, arr_nodes, source);]]></description>
			<content:encoded><![CDATA[<div>Hello All!<br />
<br />
I have been working on a network design problem and am having a problem in the following part-<br />
<br />
What I am trying to do here --<br />
{<br />
for every set of edges (a,b),<br />
{ for all arcs (l,m)<br />
assign length of -- arc [l,m] = edge [a,b][l,m]<br />
shortest_path (num_nodes, arr_nodes, source);<br />
}<br />
----------------------------------------------------------------------------<br />
Part of the Code which does the above looks like this -<br />
 <pre style="margin:20px; line-height:13px">for ( node = arr_nodes; node &lt; arr_nodes + num_nodes; node++ )<br />
{<br />
edge_tail = (node - arr_nodes) + min_node;<br />
<br />
for ( arc_pointer = node -&gt; first; arc_pointer != (node+1) -&gt; first; arc_pointer++ )<br />
{<br />
edge_head = ((arc_pointer -&gt; head_edge) - arr_nodes) + min_node;<br />
<br />
for ( node1 = arr_nodes; node1 &lt; arr_nodes + num_nodes; node1++ )<br />
{<br />
tail_arc = tail1[count1];<br />
<br />
for ( arc_pointer1 = node1 -&gt; first; arc_pointer1 != (node1+1) -&gt; first; arc_pointer1++ )<br />
{<br />
head_arc = ((arc_pointer-&gt;head_edge)-ndp)+nmin;<br />
printf ( &quot; Tail_Edge = %2ld Head_Edge = %2ld Tail_Arc = %2ld Head_Arc = %2ld Length = %4lf\n&quot;, edge_tail, head_in, tail_arc, head_arc, ta-&gt;len );<br />
arc_pointer1 -&gt; length = weight2[edge_tail][edge_head][tail_arc][head_arc];<br />
shortest_path (num_nodes, arr_nodes, source);<br />
}<br />
count1++;<br />
}<br />
}<br />
}</pre>As of now it gives segmentation fault while displaying output at the print statement.<br />
<br />
Kindly guide me in knowing what is wrong in my coding so that it could give the desired result.<br />
<br />
Thanks!</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>rt.arti</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238669.html</guid>
		</item>
		<item>
			<title>I need 2d array program</title>
			<link>http://www.daniweb.com/forums/thread238670.html</link>
			<pubDate>Sun, 15 Nov 2009 14:57:38 GMT</pubDate>
			<description>i need 2d array programm</description>
			<content:encoded><![CDATA[<div>i need 2d array programm</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>dipisahu</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238670.html</guid>
		</item>
		<item>
			<title>How to draw lines or circle (graphics) onto windows screen?</title>
			<link>http://www.daniweb.com/forums/thread238641.html</link>
			<pubDate>Sun, 15 Nov 2009 12:34:20 GMT</pubDate>
			<description>Hi , 
 
Is there a way that I can draw lines or circles etcc..(graphics) onto windows screen? 
 
Please let me know.Sample code would greatly help.</description>
			<content:encoded><![CDATA[<div>Hi ,<br />
<br />
Is there a way that I can draw lines or circles etcc..(graphics) onto windows screen?<br />
<br />
Please let me know.Sample code would greatly help.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>danibootstrap</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238641.html</guid>
		</item>
		<item>
			<title>How to open and external file or program using C</title>
			<link>http://www.daniweb.com/forums/thread238640.html</link>
			<pubDate>Sun, 15 Nov 2009 12:31:41 GMT</pubDate>
			<description><![CDATA[Hi, 
 
I want to write code for opening an external file or program from the C program.Could anyone tell me how to do this? 
 
Say if I want to open calculator.exe I mention the path in the program and it should open it or say if I want to open "image.jpg" with the default program...How shall I do...]]></description>
			<content:encoded><![CDATA[<div>Hi,<br />
<br />
I want to write code for opening an external file or program from the C program.Could anyone tell me how to do this?<br />
<br />
Say if I want to open calculator.exe I mention the path in the program and it should open it or say if I want to open &quot;image.jpg&quot; with the default program...How shall I do this?<br />
<br />
Any sample code would be of great help.<br />
<br />
Thanks in advance</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>danibootstrap</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238640.html</guid>
		</item>
		<item>
			<title>Operarors in C?</title>
			<link>http://www.daniweb.com/forums/thread238622.html</link>
			<pubDate>Sun, 15 Nov 2009 10:00:41 GMT</pubDate>
			<description>Hi 
 
Anyonem, could you please explain clearly about the order of evaluation of increment, decrement operators in an expression in C? 
 
 
Thanks in advance..</description>
			<content:encoded><![CDATA[<div>Hi<br />
<br />
Anyonem, could you please explain clearly about the order of evaluation of increment, decrement operators in an expression in C?<br />
<br />
<br />
Thanks in advance..</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>jk2005.jeeva</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238622.html</guid>
		</item>
		<item>
			<title>problem with struct creation</title>
			<link>http://www.daniweb.com/forums/thread238617.html</link>
			<pubDate>Sun, 15 Nov 2009 09:06:11 GMT</pubDate>
			<description><![CDATA[Hi,   
I would like to make a database with users. 
But I take errors in the function 
 
Could someone help me please? 
 
My code is : 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>Hi,  <br />
I would like to make a database with users.<br />
But I take errors in the function<br />
<br />
Could someone help me please?<br />
<br />
My code is :<br />
<br />
 <pre style="margin:20px; line-height:13px">typedef struct user user;<br />
<br />
int id2=0;<br />
<br />
struct user<br />
{<br />
&nbsp;  char name[20];<br />
&nbsp; char last[20];<br />
&nbsp; int id;<br />
};<br />
<br />
int function(user* users, int id, char name[], char surname[]){<br />
user* u = users+id2;<br />
strcpy(u-&gt;name,name1);<br />
strcpy(u-&gt;surname,surname1);<br />
u-&gt;id=id2;<br />
}<br />
<br />
main()<br />
{<br />
&nbsp; char name1[20];<br />
&nbsp; char surname1[20];<br />
&nbsp; users[50];<br />
<br />
if(function(users, id,name1,surname1))<br />
&nbsp; &nbsp; ++id2;<br />
<br />
// and then I would like to print name,surname,id form created struct ..... ??<br />
}</pre><br />
Thanks a lot</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>bufospro</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238617.html</guid>
		</item>
		<item>
			<title><![CDATA[error C2059: syntax error : '<']]></title>
			<link>http://www.daniweb.com/forums/thread238600.html</link>
			<pubDate>Sun, 15 Nov 2009 07:19:01 GMT</pubDate>
			<description><![CDATA[hello guys, 
 
I get this error MSG and I can't understand what is the problem with my code. my program consist a menu with 5 options: 
1. The program remove double digit from a given number. 
2. The program rotate the first number to the right according to the second number. 
3. The program checks...]]></description>
			<content:encoded><![CDATA[<div>hello guys,<br />
<br />
I get this error MSG and I can't understand what is the problem with my code. my program consist a menu with 5 options:<br />
1. The program remove double digit from a given number.<br />
2. The program rotate the first number to the right according to the second number.<br />
3. The program checks if the 2 numbers are permmutations of each other.<br />
4. The program search how many times the second number appear in the first number,<br />
9. Exit.<br />
<br />
I know it's very long but please try to help me, I really don't have a clue. All programs work fine when I run them in a seperate file but when I put them all together I get this error so I assume there's something wrong with the menu.<br />
<br />
cheers,<br />
Elad.</div>  <br /> <div style="padding:5px">     <fieldset class="fieldset"> <legend>Attached Files</legend> <table cellpadding="0" cellspacing="5" border="0"> <tr> <td><img class="inlineimg" src="http://www.daniweb.com/forums/images/attach/txt.gif" alt="File Type: txt" width="16" height="16" border="0" style="vertical-align:baseline" /></td> <td><a href="http://www.daniweb.com/forums/attachment.php?attachmentid=12561&amp;d=1258269343">site.txt</a> (4.9 KB)</td> </tr> </table> </fieldset>  </div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>redroze</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238600.html</guid>
		</item>
		<item>
			<title>Need Help Translating</title>
			<link>http://www.daniweb.com/forums/thread238587.html</link>
			<pubDate>Sun, 15 Nov 2009 03:56:57 GMT</pubDate>
			<description><![CDATA[Hi,  
I was wondering if anyone can help me translate this into java. 
Thanks 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags"...]]></description>
			<content:encoded><![CDATA[<div>Hi, <br />
I was wondering if anyone can help me translate this into java.<br />
Thanks<br />
 <pre style="margin:20px; line-height:13px">#include &quot;Element.h&quot;<br />
#include &lt;stdlib.h&gt;<br />
<br />
element * Element(int s1, int w1, double c1, int x1, int k1)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; element * retval = malloc(sizeof(element));<br />
&nbsp; &nbsp; &nbsp; &nbsp; retval-&gt;s = s1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; retval-&gt;w = w1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; retval-&gt;c = (float) s1 / (float) w1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; retval-&gt;x = x1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; retval-&gt;k = k1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; return retval;<br />
}</pre> <pre style="margin:20px; line-height:13px">typedef struct<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int s; //value of coin<br />
&nbsp; &nbsp; &nbsp; &nbsp; int w; // weight of coin<br />
&nbsp; &nbsp; &nbsp; &nbsp; float c; // (s / w) <br />
&nbsp; &nbsp; &nbsp; &nbsp; int x; // number of coin to be used<br />
&nbsp; &nbsp; &nbsp; &nbsp; int k; // index of coin of this value in S[n]<br />
} element;<br />
<br />
element * Element(int s1, int w1, double c1, int x1, int k1);</pre> <pre style="margin:20px; line-height:13px">#include &quot;externals.h&quot;<br />
<br />
int B = 7;<br />
int n = N;<br />
<br />
int S[N] = {4, 1, 3};<br />
int X[N];<br />
int W[N];<br />
<br />
element * A[N];<br />
element * Solution[N];</pre> <pre style="margin:20px; line-height:13px">#include &quot;Element.h&quot;<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;stdio.h&gt;<br />
<br />
#define N 3<br />
<br />
#define new <br />
#define BOOL int<br />
#define FALSE 0<br />
#define TRUE 1<br />
<br />
<br />
extern int B;<br />
extern int n;<br />
<br />
extern int S[N];<br />
extern int X[N];<br />
extern int W[N];<br />
<br />
extern element * A[N];<br />
extern element * Solution[N];</pre> <pre style="margin:20px; line-height:13px">#include &quot;functions.h&quot;<br />
#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;math.h&gt;<br />
<br />
<br />
/**************************************************************<br />
&nbsp;Algorithm:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Sort<br />
&nbsp;<br />
&nbsp;Parameters:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; an array of pointers to element objects.<br />
&nbsp;<br />
&nbsp;Description:&nbsp; &nbsp; &nbsp; &nbsp; algorithm looks at the &quot;value density&quot; (c) of <br />
&nbsp;the objects and sorts them upon that parameter<br />
&nbsp;in non-increasing order.<br />
&nbsp;<br />
&nbsp;Side Effects:&nbsp; &nbsp; &nbsp; &nbsp; algorithm modifies global array &quot;A&quot;<br />
&nbsp;parameter is technically not used, but<br />
&nbsp;replacement of &quot;A&quot; with the parameter<br />
&nbsp;will cause effect to be on the parameter<br />
&nbsp;this is strictly unecessary in this particular<br />
&nbsp;algorithm<br />
&nbsp;**************************************************************/<br />
void Sort(element * array[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; element * largest;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i, j;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; n; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; largest = A[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (j = i; j &lt; n; j++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (A[j]-&gt;c &gt; largest-&gt;c)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; largest = A[j];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; A[j] = A[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; A[i] = largest;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
<br />
<br />
<br />
/**************************************************************<br />
&nbsp;Algorithm:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Greedy<br />
&nbsp;<br />
&nbsp;Parameters:&nbsp; &nbsp; &nbsp; &nbsp; A &quot;remainder&quot; (number to be consumed), and an<br />
&nbsp;integer &quot;i&quot; marked as a starting index for<br />
&nbsp;manipulations on global array.<br />
&nbsp;<br />
&nbsp;Description:&nbsp; &nbsp; &nbsp; &nbsp; A greedy algorithm to increase the concentrations<br />
&nbsp;of each object in the sorted array to consume as<br />
&nbsp;much of the remainder as possible given the<br />
&nbsp;starting element lovcated at the index.<br />
&nbsp;<br />
&nbsp;Side Effects:&nbsp; &nbsp; &nbsp; &nbsp; The algorithm modifies both global arrays &quot;A&quot; <br />
&nbsp;(necessarily) and &quot;Solution&quot; (conditionally). <br />
&nbsp;Producing viable solutions to the value partitioning<br />
&nbsp;problem, and replacing the global solution<br />
&nbsp;if the local one is more efficient based on the<br />
&nbsp;constraints of the problem.<br />
&nbsp;**************************************************************/<br />
void Greedy(int remainder, int i)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int number;<br />
&nbsp; &nbsp; &nbsp; &nbsp; number = floor(remainder / A[i]-&gt;s);<br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; A[i]-&gt;x = number;<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (totalValue(A, 0, N-1) == B) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (!Solution[0] || totalWeight(A, 0, N-1) &lt; totalWeight(Solution, 0, N-1)) <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; copyArr(A, Solution);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else if (i == (N-1))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Greedy((remainder % A[i]-&gt;s), (i+1));<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
<br />
/**************************************************************<br />
&nbsp;Algorithm:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Backtrack<br />
&nbsp;<br />
&nbsp;Parameters:&nbsp; &nbsp; &nbsp; &nbsp; Integers &quot;start&quot; and &quot;stop&quot; marking the indicies<br />
&nbsp;of the global array &quot;A&quot; over which the algorithm<br />
&nbsp;will operate during its call. <br />
&nbsp;<br />
&nbsp;Description:&nbsp; &nbsp; &nbsp; &nbsp; A backtracking algorithm, assuming a pre-sorted<br />
&nbsp;array in &quot;locally greedy&quot; (between the indicies) <br />
&nbsp;concentrations. The algorithm moves slowly between<br />
&nbsp;start and stop, from right to left, decrementing <br />
&nbsp;the concentration of the object at the current<br />
&nbsp;index, calling Greedy() from that point. This<br />
&nbsp;forces a trace over the entire permutation space<br />
&nbsp;of all viable solutions. Comparisons to the global<br />
&nbsp;solution array, as described in documentation above,<br />
&nbsp;are performed in Greedy(). The algorithm recurses<br />
&nbsp;until the entire solution space between the indicies<br />
&nbsp;is mapped. Then returns control to the calling<br />
&nbsp;function. (In terminus, main())<br />
&nbsp;<br />
&nbsp;Side Effects:&nbsp; &nbsp; &nbsp; &nbsp; The algorithm modifies global array &quot;A&quot; directly<br />
&nbsp;and &quot;Solution&quot; indirectly by calling Greedy()<br />
&nbsp;which has this known side effect.<br />
&nbsp;**************************************************************/<br />
void Backtrack(int stop, int start)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int dec_pos = start;<br />
&nbsp; &nbsp; &nbsp; &nbsp; while (TRUE) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (dec_pos &lt; 0) <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (A[dec_pos]-&gt;x != 0) <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; A[dec_pos]-&gt;x--;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; dec_pos--;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; continue;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Greedy(B-totalValue(A, 0, dec_pos), (dec_pos + 1));<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Backtrack((dec_pos + 1), N-2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (dec_pos != stop)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; dec_pos--;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; break;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
<br />
/**************************************************************<br />
&nbsp;Algorithm:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; totalValue<br />
&nbsp;<br />
&nbsp;Parameters:&nbsp; &nbsp; &nbsp; &nbsp; An array of pointers to element objects<br />
&nbsp;two integers start and end.<br />
&nbsp;<br />
&nbsp;Description:&nbsp; &nbsp; &nbsp; &nbsp; Computes the total value of the objects between<br />
&nbsp;the indicies given their concentrations and<br />
&nbsp;individual values.<br />
&nbsp;<br />
&nbsp;Side Effects:&nbsp; &nbsp; &nbsp; &nbsp; None<br />
&nbsp;**************************************************************/<br />
int totalValue(element * array[], int start, int end)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int total = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; element * e;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = start; i &lt;= end ; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; e = array[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; total += e-&gt;s * e-&gt;x;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; return total;<br />
}<br />
<br />
<br />
/**************************************************************<br />
&nbsp;Algorithm:&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; totalWeight<br />
&nbsp;<br />
&nbsp;Parameters:&nbsp; &nbsp; &nbsp; &nbsp; An array of pointers to element objects<br />
&nbsp;two integers start and end.<br />
&nbsp;<br />
&nbsp;Description:&nbsp; &nbsp; &nbsp; &nbsp; Computes the total weight of the objects between<br />
&nbsp;the indicies given their concentrations and<br />
&nbsp;individual weights.<br />
&nbsp;<br />
&nbsp;Side Effects:&nbsp; &nbsp; &nbsp; &nbsp; None<br />
&nbsp;**************************************************************/<br />
int totalWeight(element * array[], int start, int end)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; int total = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; element * e;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = start; i &lt;= end ; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; e = array[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; total += e-&gt;w * e-&gt;x;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; return total;<br />
}<br />
<br />
<br />
//prints the entire array to STDIO<br />
void printArr(element * array[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; N; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%i, &quot;, array[i]-&gt;x);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\n&quot;);<br />
}<br />
<br />
<br />
//prints elements and their values to STDIO, used for debugging and for useful info<br />
void printElements(element * array[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; N; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%i:\n\t%i\n\t%i\n\t%i\n\t%f\n\n&quot;, i, array[i]-&gt;s, array[i]-&gt;w, array[i]-&gt;k, array[i]-&gt;c);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
//copies the contents of one array of element objects into another to preserve the values.<br />
void copyArr(element * source[], element * target[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i = 0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; N; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; element * old_e = source[i];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; element * new_e = new Element(old_e-&gt;s, old_e-&gt;w, old_e-&gt;c, old_e-&gt;x, old_e-&gt;k);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; target[i] = new_e;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
<br />
/**************************************************************<br />
&nbsp;Algorithms:&nbsp; &nbsp; &nbsp; &nbsp; initialization functions<br />
&nbsp;<br />
&nbsp;Parameters:&nbsp; &nbsp; &nbsp; &nbsp; None<br />
&nbsp;<br />
&nbsp;Description:&nbsp; &nbsp; &nbsp; &nbsp; Computes the weight values for each object based<br />
&nbsp;on the total function w() given as input in this<br />
&nbsp;assignment. The array of objects &quot;A&quot; is constructed.<br />
&nbsp;The first element in &quot;Solution&quot; is set to NULL to <br />
&nbsp;prevent a segfault when first checking against the<br />
&nbsp;total weight in Greedy().<br />
&nbsp;<br />
&nbsp;Side Effects:&nbsp; &nbsp; &nbsp; &nbsp; Global arrays W, A, and Solution are modified.<br />
&nbsp;**************************************************************/<br />
<br />
void initialize()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; Solution[0] = NULL;<br />
&nbsp; &nbsp; &nbsp; &nbsp; initialize_W();<br />
&nbsp; &nbsp; &nbsp; &nbsp; initialize_A();<br />
}<br />
<br />
void initialize_A()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; N; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; A[i] = new Element(S[i], W[i], 1, 0, i);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
void initialize_W()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; register int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for (i = 0; i &lt; N; i++) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; W[i] = w(S[i]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
<br />
//total function w given in the assignment, this can be any total function on the set of real integers<br />
//it is currently set to return 1, as the last step in debugging was to check the condition for objects<br />
//with equal weight. <br />
int w(int s)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 1;<br />
}</pre> <pre style="margin:20px; line-height:13px">#include &quot;externals.h&quot;<br />
<br />
void Sort(element * array[]);<br />
void Greedy(int remainder, int i);<br />
void Backtrack(int stop, int start);<br />
<br />
int totalValue(element * array[], int start, int end);<br />
int totalWeight(element * array[], int start, int end);<br />
<br />
void printArr(element * array[]);<br />
void printElements(element * array[]);<br />
void copyArr(element * source[], element * target[]);<br />
<br />
void initialize();<br />
void initialize_A();<br />
void initialize_W();<br />
int w(int s);</pre> <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &quot;functions.h&quot;<br />
<br />
int main (int argc, const char * argv[]) <br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; initialize();<br />
&nbsp; &nbsp; &nbsp; &nbsp; Sort(A);<br />
&nbsp; &nbsp; &nbsp; &nbsp; printElements(A);<br />
&nbsp; &nbsp; &nbsp; &nbsp; Greedy(B, 0);<br />
&nbsp; &nbsp; &nbsp; &nbsp; Backtrack(0, N-2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if (totalValue(Solution, 0, N-1) != B) <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;No Solution\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printArr(Solution);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>vampgirl13</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238587.html</guid>
		</item>
		<item>
			<title>arrays</title>
			<link>http://www.daniweb.com/forums/thread238549.html</link>
			<pubDate>Sat, 14 Nov 2009 21:53:14 GMT</pubDate>
			<description><![CDATA[I am trying to write a program that reads a string and shortens it if the letters are in a row. For instance abcdghigjhkhdf becomes a-dg-igkhkhdf. I want that it erases the ;etters it erases but it is not working. HEre is my code: 
  <div class="codeblock"> <div class="spaced"> <div...]]></description>
			<content:encoded><![CDATA[<div>I am trying to write a program that reads a string and shortens it if the letters are in a row. For instance abcdghigjhkhdf becomes a-dg-igkhkhdf. I want that it erases the ;etters it erases but it is not working. HEre is my code:<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
<br />
#define MAXSTRING 100 <br />
void main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char str[MAXSTRING]={0};<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Please input a string of letters without a space or numbers.&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; scanf_s(&quot;%s&quot;, &amp;str);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; convertString(str);<br />
<br />
}<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; void convertString(char string[])<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int i=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; char startOfNewConinuation=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while (string[i]!= 0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (string[i]!= '-')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; startOfNewConinuation=string[i];<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if ((string[i+1]=string[i]+1) &amp;&amp; (startOfNewConinuation=string[i]))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; string[i+1]='-';<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; string[i]='';<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;\nThe new string is %s&quot;,string);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>leeba</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238549.html</guid>
		</item>
		<item>
			<title>Passing a pointer</title>
			<link>http://www.daniweb.com/forums/thread238515.html</link>
			<pubDate>Sat, 14 Nov 2009 18:08:54 GMT</pubDate>
			<description><![CDATA[In an assignment for class we have to ask the user how many characters they'd like to enter and then read the characters into an array of that size. I've had problems with calling a function to do this. I will also be passing this array to other functions, so I'm not sure if anything has to be...]]></description>
			<content:encoded><![CDATA[<div>In an assignment for class we have to ask the user how many characters they'd like to enter and then read the characters into an array of that size. I've had problems with calling a function to do this. I will also be passing this array to other functions, so I'm not sure if anything has to be modified either.<br />
<br />
This is what I've done so far<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
#include &lt;stdlib.h&gt;<br />
#include &lt;string.h&gt;<br />
<br />
void Test(char, int);<br />
<br />
int main()<br />
{<br />
&nbsp; &nbsp; char *text;<br />
&nbsp; &nbsp; int i, size, *sizeptr;<br />
&nbsp; &nbsp; sizeptr = &amp;size;<br />
&nbsp; &nbsp; Test(text, size);<br />
&nbsp; &nbsp; for(i = 0; i &lt; size; i++)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; putchar(text[i]);<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; system(&quot;PAUSE&quot;);<br />
&nbsp; &nbsp; return(0);<br />
}<br />
<br />
void Test(char *text, int *sizeptr)<br />
{<br />
&nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; printf(&quot;How many characters do you want to enter?\t&quot;);<br />
&nbsp; &nbsp; scanf(&quot;%d&quot;, sizeptr);<br />
&nbsp; &nbsp; text = (char*) malloc(*sizeptr * sizeof(char));<br />
&nbsp; &nbsp; memset(text, 0, *sizeptr);<br />
&nbsp; &nbsp; printf(&quot;Enter your text: (DO NOT INCLUDE SPACES)\n&quot;);<br />
&nbsp; &nbsp; scanf(&quot;%s&quot;, text);<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>kgomes</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238515.html</guid>
		</item>
		<item>
			<title>Parsing in C</title>
			<link>http://www.daniweb.com/forums/thread238496.html</link>
			<pubDate>Sat, 14 Nov 2009 14:25:32 GMT</pubDate>
			<description><![CDATA[Hi,  
 
I'm new to this site so apologies for any mistakes. I'm trying to write a program to parse string from a file. In each string I then have to parse the different strings for example: 
 
add  h'13', 4 
 
So I've to parse the 'add' bit, the '13' bit and the '4' bit. At the minute I'm trying to...]]></description>
			<content:encoded><![CDATA[<div>Hi, <br />
<br />
I'm new to this site so apologies for any mistakes. I'm trying to write a program to parse string from a file. In each string I then have to parse the different strings for example:<br />
<br />
add  h'13', 4<br />
<br />
So I've to parse the 'add' bit, the '13' bit and the '4' bit. At the minute I'm trying to use strtok but I'm getting a run time error. <br />
<br />
 <pre style="margin:20px; line-height:13px">/* Libraries */<br />
#include &lt;stdio.h&gt;<br />
#include &lt;string.h&gt;<br />
<br />
/* Main Function */<br />
int main()<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; /* Declarations */<br />
&nbsp; &nbsp; char *instruction;<br />
&nbsp; &nbsp; char *action;<br />
&nbsp; &nbsp; char *number;<br />
&nbsp; &nbsp; char *number2;<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; instruction = &quot;add&nbsp; h'13', 4&quot;;<br />
&nbsp; &nbsp; <br />
&nbsp; &nbsp; printf(&quot;%s \n&quot;,instruction);<br />
<br />
// The run time error occurs here<br />
<br />
&nbsp; &nbsp; action = strtok ( instruction, &quot; &quot; );<br />
&nbsp; &nbsp; number = strtok ( NULL, &quot; ' &quot; );<br />
number2 = strtok ( NULL, &quot;,&quot; );<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;%s \n %s \n %s \n&quot;, action, number, number2);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; system(&quot;PAUSE&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre><br />
Any help you can give me would be greatly appreciated. Thanks.</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>pmee</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238496.html</guid>
		</item>
		<item>
			<title>Remove Duplicate Items from char Array</title>
			<link>http://www.daniweb.com/forums/thread238452.html</link>
			<pubDate>Sat, 14 Nov 2009 08:08:56 GMT</pubDate>
			<description><![CDATA[What is the method to remove dupplicate items from an character array?? 
 
A Sample Program is Here which take two arrays merge them and sort them please include some lines that should remove duplicates from an resulted array?? 
 
 
  <div class="codeblock"> <div class="spaced"> <div...]]></description>
			<content:encoded><![CDATA[<div>What is the method to remove dupplicate items from an character array??<br />
<br />
A Sample Program is Here which take two arrays merge them and sort them please include some lines that should remove duplicates from an resulted array??<br />
<br />
<br />
 <pre style="margin:20px; line-height:13px">#include &lt;stdio.h&gt;<br />
<br />
&nbsp; <br />
// A simple bubble sort<br />
void sort(char data[], int length)<br />
{<br />
&nbsp;  int end = length - 1;<br />
&nbsp;  for (int i = 0; i &lt; length; ++i) <br />
&nbsp;  {<br />
&nbsp; &nbsp; &nbsp;  for (int j = 0; j &lt; end; ++j) <br />
&nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  if (data[j] &gt; data[j+1])<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  char tmp = data[j];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  data[j] = data[j+1];<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  data[j+1] = tmp;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp;  }<br />
&nbsp; &nbsp; &nbsp;  --end;<br />
&nbsp;  }<br />
}<br />
<br />
int main(void)<br />
{<br />
&nbsp;  char firstArray[10];<br />
&nbsp;  char secondArray[10];<br />
&nbsp;  char mergedArray[20];<br />
<br />
&nbsp;  int i;<br />
&nbsp;  int mergedIndex;<br />
<br />
&nbsp;  printf(&quot;Put in the first array\n&quot;);<br />
&nbsp;  fgets(firstArray, sizeof(firstArray), stdin);<br />
<br />
&nbsp;  printf(&quot;Put in the second array\n&quot;);<br />
&nbsp;  fgets(secondArray, sizeof(secondArray), stdin);<br />
<br />
&nbsp;  // Copy the first array into the merged array<br />
&nbsp;  for(i = 0; firstArray[i] != '\n'; ++i)<br />
&nbsp;  {<br />
&nbsp; &nbsp; &nbsp;  mergedArray[i] = firstArray[i];<br />
&nbsp;  }<br />
&nbsp;  mergedIndex = i;<br />
&nbsp;  for(i = 0; secondArray[i] != '\n'; ++i)<br />
&nbsp;  {<br />
&nbsp; &nbsp; &nbsp;  mergedArray[mergedIndex++] = secondArray[i];<br />
&nbsp;  }<br />
&nbsp;  mergedArray[mergedIndex] = 0;<br />
<br />
&nbsp;  sort(mergedArray, mergedIndex);<br />
&nbsp;  printf(&quot;Merged array is '%s'\n&quot;, mergedArray);<br />
&nbsp;  return 0;<br />
}</pre><br />
Thanks inAdvance</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>voxis</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238452.html</guid>
		</item>
		<item>
			<title>Help with loops</title>
			<link>http://www.daniweb.com/forums/thread238431.html</link>
			<pubDate>Sat, 14 Nov 2009 04:52:01 GMT</pubDate>
			<description><![CDATA[My code:  
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a href="/forums/misc.php?do=explaincode&amp;TB_iframe=true&amp;height=400&amp;width=680" class="thickbox" title="Help with Code Tags" target="_blank">Help with Code Tags</a> </div> <div> <strong>C...]]></description>
			<content:encoded><![CDATA[<div>My code: <br />
 <pre style="margin:20px; line-height:13px">&nbsp; printf(&quot;\n&quot;); <br />
&nbsp; printf(&quot;\tSlalom Race, Version 1.0\t\t\n\n&quot;);<br />
&nbsp; printf(&quot;1. Play\n&quot;);<br />
&nbsp; printf(&quot;2. Instructions\n&quot;); <br />
&nbsp; printf(&quot;3. Quit\n\n&quot;); <br />
&nbsp; printf(&quot;Your choice: &quot;); <br />
&nbsp; scanf(&quot;%d&quot;, &amp;choice); <br />
&nbsp; }&nbsp; <br />
&nbsp;<br />
&nbsp; /* Initializes loop to begin game */ <br />
&nbsp; while (choice != 3) { <br />
&nbsp;<br />
&nbsp; /* Begins execution of game and Selects instructions if needed */ <br />
&nbsp; while (choice == 1) { <br />
&nbsp; printf(&quot;You are at the start.\n&quot;); <br />
&nbsp;  printf(&quot;Time elapsed: 0.000000 sec\n&quot;); <br />
&nbsp; printf(&quot;Current velocity: 0.000000 m/sec\n&quot;); <br />
&nbsp; printf(&quot;Next Gate: 1. Velocity limit: 10.00 m/sec\n&quot;); <br />
&nbsp;  printf(&quot;Your action (1 - 7):&quot;); <br />
&nbsp;  scanf(&quot;%d&quot;, &amp;accelComand); <br />
&nbsp;<br />
<br />
&nbsp;  /* Determines if the command is in between 1 and 7 */ <br />
&nbsp;  while (!(accelComand &lt;=SEVEN) || !(accelComand &gt;= 1)) { <br />
&nbsp;  printf(&quot;Your action (1 - 7):&quot;); <br />
&nbsp;  scanf(&quot;%d&quot;, &amp;accelComand); <br />
&nbsp;  } <br />
&nbsp;<br />
&nbsp; &nbsp; /* Calculates velocity and time of Leg1 */ <br />
&nbsp;  accelLeg1 = acceleration[accelComand-1]; <br />
&nbsp;  velLeg1 = sqrt(TWO*accelLeg1*FIFTY); <br />
&nbsp;  timeLeg1 = (velLeg1 / accelLeg1); <br />
&nbsp;  printf(&quot;\n\n&quot;); <br />
&nbsp;<br />
&nbsp;  if (velLeg1 &gt; 10) { <br />
&nbsp;  printf(&quot;\n\n\n&quot;);<br />
&nbsp; &nbsp; printf(&quot;Your velocity at gate 1 was %f m/sec\n&quot;,velLeg1); <br />
&nbsp;  printf(&quot;You have lost control and went into&quot;); <br />
&nbsp;  printf(&quot; a nearby snow pile!\n&quot;);<br />
&nbsp; &nbsp; printf(&quot;You failed the race and went&quot;); <br />
&nbsp;  printf(&quot; face down into the snow!\n&quot;); <br />
&nbsp;  printf(&quot;Better luck next time!\n&quot;); <br />
&nbsp;<br />
&nbsp; &nbsp; } <br />
&nbsp;else { <br />
&nbsp; if (velLeg1 &lt;= 0) {<br />
&nbsp;  printf(&quot;You stopped before reaching the gate.\n&quot;); <br />
&nbsp; printf(&quot;Your attempt to pick up the speed laned you&quot;); <br />
&nbsp; printf(&quot; in a snow pile.\n&quot;); <br />
&nbsp; printf(&quot;You failed the race due to your&quot;); <br />
&nbsp; printf(&quot;overburdening caution.\n&quot;); <br />
&nbsp; printf(&quot;Better luck next time.\n&quot;);<br />
&nbsp; }<br />
&nbsp;  } <br />
&nbsp; printf(&quot;\n&quot;); <br />
&nbsp; printf(&quot;You are at Gate 1\n&quot;); <br />
&nbsp; printf(&quot;Time elapsed: %f sec\n&quot;, timeLeg1);<br />
&nbsp;  printf(&quot;Current velocity: %f m/sec\n&quot;,velLeg1); <br />
&nbsp;  p rintf(&quot;Next Gate: 2. Velocity limit: 18.00 m/sec\n&quot;); <br />
&nbsp; &nbsp; printf(&quot;Your action (1 - 7):&quot;); 60. scanf(&quot;%d&quot;, &amp;accelComand);</pre><br />
As you can see my code asks the user to input 3 numbers: 1,2,3 in lines 1-7. My only concern is when they choose 1. When they select &quot;1&quot;, game execution begins and depending on the given command (the command itself is the acceleration which determines the time and velocity) lines 34 - 51 will determine the output of lines 54-60. If one of the conditions are satisfied in lines 34-51 THEN the program will go back in asking the user in lines 1-7 again. That is my problem, i dont know what to put in lines 34-51 if one of the conditions are satisfied and go back in asking the user in lines 1-7. Any suggestions?????</div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>speedy94519</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238431.html</guid>
		</item>
		<item>
			<title>help making MakeFile</title>
			<link>http://www.daniweb.com/forums/thread238411.html</link>
			<pubDate>Sat, 14 Nov 2009 01:20:09 GMT</pubDate>
			<description><![CDATA[I am suppose to make a MakeFile for the 2 source files named p4a.c and p4b.c 
Am i doing this makefile correctly? Any suggestions would be so helpful 
 
my MakeFile so far 
 
  <div class="codeblock"> <div class="spaced"> <div style="float:right; margin-right:10px"> <a...]]></description>
			<content:encoded><![CDATA[<div>I am suppose to make a MakeFile for the 2 source files named p4a.c and p4b.c<br />
Am i doing this makefile correctly? Any suggestions would be so helpful<br />
<br />
my MakeFile so far<br />
<br />
 <pre style="margin:20px; line-height:13px">.SUFFIXES: .c .o<br />
CC - gcc<br />
CFLAGS = -g<br />
.c.o:<br />
&nbsp; &nbsp;  $(CC) $(CFLAGS) -c $,<br />
<br />
sample: p4a.c p4b.c<br />
&nbsp; &nbsp; &nbsp;  gcc p4a.c p4b.c -o sample<br />
<br />
p4a.c:<br />
<br />
p4b.c:<br />
<br />
clean:<br />
&nbsp; &nbsp; &nbsp;  rm -f *.o core</pre><br />
<br />
p4a.c<br />
<br />
 <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
#include&lt;string.h&gt;<br />
<br />
<br />
main(int argc,char* argv[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; short int a[100][5];<br />
&nbsp; &nbsp; &nbsp; &nbsp; short int res;<br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; FILE *fp1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(!(fp1=fopen(argv[1],&quot;r&quot;)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error opening file\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; FILE *fp2;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; int i,j,k,l;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i=j=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(!feof(fp1))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(j=0;j&lt;4;j++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fscanf(fp1,&quot;%d&quot;,&amp;a[i][j]); <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(k=0;k&lt;i;k++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; unsigned short int musk=!0; //musk=11...111<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; musk=musk|15;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //musk=000..001111<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; musk=musk&lt;&lt;12;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //musk=111100..000<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; res=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(l=0;l&lt;4;l++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; short int temp=(a[k][l]&amp;musk);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; res=res|temp;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; musk=musk&gt;&gt;4;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; a[k][4]=res;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(!(fp2=fopen(argv[2],&quot;w&quot;)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error:cannot open file&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(k=0;k&lt;i;k++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(j=0;j&lt;5;j++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%d%s&quot;,a[k][j],&quot;\t&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%s&quot;,&quot;\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fclose(fp1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fclose(fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
}<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre><br />
p4b.c<br />
<br />
 <pre style="margin:20px; line-height:13px">#include&lt;stdio.h&gt;<br />
#include&lt;string.h&gt;<br />
#include&lt;stdlib.h&gt;<br />
<br />
typedef struct token<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char name[15];<br />
&nbsp; &nbsp; &nbsp; &nbsp; int def,usecount,use[100];<br />
}identifier;<br />
<br />
identifier id[1000];<br />
int idcounter;<br />
<br />
void search(char* token,int linenum)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; int i;<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(i=0;i&lt;idcounter;i++)&nbsp; &nbsp; &nbsp; &nbsp; //check if already exist<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(!strcmp(token,id[i].name))&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; id[i].use[id[i].usecount]=linenum;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; id[i].usecount++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; //insert<br />
&nbsp; &nbsp; &nbsp; &nbsp; strcpy(id[idcounter].name,token);<br />
&nbsp; &nbsp; &nbsp; &nbsp; id[idcounter].def=linenum;<br />
&nbsp; &nbsp; &nbsp; &nbsp; id[idcounter].usecount=0;<br />
&nbsp; &nbsp; &nbsp; &nbsp; idcounter++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; <br />
}<br />
<br />
void check(char line[81],int linenum)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char token1[15];<br />
&nbsp; &nbsp; &nbsp; &nbsp; char* token=(char*)malloc(sizeof(char)*15);<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(line[0]=='_' || (line[0]&gt;='a' &amp;&amp; line[0]&lt;='z') || (line[0]&gt;='A' &amp;&amp; line[0]&lt;='Z'))&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token=strtok(line,&quot; ,\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; //take label<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(token1,token);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token1[strlen(token1)-1]==':')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token1[strlen(token1)-1]='\0';<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; search(token1,linenum);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token=strtok(0,&quot; ,\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //skip opcode\datatype<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(token1,token);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token1[0]=='.')&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //check data type<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(token)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token=strtok(0,&quot; ,\t&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(token1,token);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token1[0]=='#')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //start of comment<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if(token1[0]=='_' || (token1[0]&gt;='a' &amp;&amp; token1[0]&lt;='z') || (token1[0]&gt;='A' &amp;&amp; token1[0]&lt;='Z'))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token1[strlen(token)-1]=='\n')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token1[strlen(token)-1]='\0';<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; search(token1,linenum);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token=strtok(line,&quot; ,\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; //skip opcode<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token=strtok(0,&quot; ,\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //search for optional operands<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; while(token)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(token1,token);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token1[0]=='#')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //start of comment<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if(token1[0]=='_' || (token1[0]&gt;='a' &amp;&amp; token1[0]&lt;='z') || (token1[0]&gt;='A' &amp;&amp; token1[0]&lt;='Z'))<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(token1[strlen(token)-1]=='\n')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token1[strlen(token)-1]='\0';<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; search(token1,linenum);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; token=strtok(0,&quot; ,\t&quot;);&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
}<br />
<br />
main(int argc,char* argv[])<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp; char line[81],line2[81];&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; int i,linenum,p,q;<br />
&nbsp; &nbsp; &nbsp; &nbsp; FILE *fp1,*fp2;<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(argc!=3)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //check invalid command<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Invalid command argument number\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(!(fp1=fopen(argv[1],&quot;r&quot;)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error opening inputfile\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; if(!(fp2=fopen(argv[2],&quot;w&quot;)))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; printf(&quot;Error opening outputfile\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return 1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; linenum=i=1;<br />
&nbsp; &nbsp; &nbsp; &nbsp; while(fgets(line,81,fp1))<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(line[0]=='#')<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //fputs(strcat(strcat(itoa(i,str,100),&quot;.&nbsp; &quot;),line),fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //fputs(&quot;\n&quot;,fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%d%s&quot;,i,&quot;.&nbsp; &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fputs(line,fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; linenum++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else if(strlen(line)&gt;1)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; strcpy(line2,line);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%d%s&quot;,i,&quot;.&nbsp; &quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fputs(line2,fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //fputs(strcat(strcat(itoa(i,str,100),&quot;.&nbsp; &quot;),line2),fp2);&nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; check(line,linenum);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; linenum++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //printf(&quot;%d.\t%s&quot;,i,line);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fputs(line,fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; //fputs(&quot;\n&quot;,fp2);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; linenum++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%s&quot;,&quot;\n\n\tCross Reference Table\n&quot;);<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%s&quot;,&quot;\n\nname\t\t def\t \tuse\n\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; for(p=0;p&lt;idcounter;p++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%s\t\t%d\t\t&quot;,id[p].name,id[p].def);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for(q=0;q&lt;id[p].usecount;q++)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(q==0)<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%d&quot;,id[p].use[q]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; else<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%c%d&quot;,',',id[p].use[q]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; fprintf(fp2,&quot;%s&quot;,&quot;\n&quot;);<br />
&nbsp; &nbsp; &nbsp; &nbsp; }<br />
&nbsp; &nbsp; &nbsp; &nbsp; fclose(fp1);<br />
&nbsp; &nbsp; &nbsp; &nbsp; fclose(fp1);<br />
<br />
<br />
&nbsp; &nbsp; &nbsp; &nbsp; return 0;<br />
}</pre></div> ]]></content:encoded>
			<category domain="http://www.daniweb.com/forums/forum118.html">C</category>
			<dc:creator>cabosun</dc:creator>
			<guid isPermaLink="true">http://www.daniweb.com/forums/thread238411.html</guid>
		</item>
	</channel>
</rss>
