08.11.2014 Views

c_kitap

c_kitap

c_kitap

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

C ve Sistem Programcıları Derneği - C Ders Notları - Necati Ergin<br />

int main()<br />

{<br />

int a[SIZE];<br />

int k;<br />

srand(time(0));<br />

for (k = 0; k < SIZE; ++k) {<br />

int val;<br />

while (1) {<br />

int i;<br />

val = rand() % MAX;<br />

for (i = 0; i < k; ++i)<br />

if (val == a[i])<br />

break;<br />

if (i == k)<br />

break;<br />

}<br />

a[k] = val;<br />

}<br />

/* dizi yazdırılıyor */<br />

for (k = 0; k < SIZE; ++k)<br />

printf("%d ", a[k]);<br />

printf("\n");<br />

}<br />

return 0;<br />

Aşağıdaki programda sıralı iki dizi, bir sıralı dizi biçiminde birleştiriliyor:<br />

#include <br />

#define SIZE 10<br />

int main()<br />

{<br />

int a[SIZE] = {2, 3, 6, 7, 8, 9, 13, 45, 78, 79};<br />

int b[SIZE] = {1, 2, 4, 5, 7, 9, 10, 18, 33, 47};<br />

int c[SIZE + SIZE];<br />

int k;<br />

int index1 = 0, index2 = 0;<br />

for (k = 0; k < SIZE + SIZE; ++k)<br />

if (index1 == SIZE)<br />

c[k] = b[index2++];<br />

else if (index2 == SIZE)<br />

c[k] = a[index1++];<br />

else {<br />

if (a[index1] < b[index2])<br />

c[k] = a[index1++];<br />

else<br />

c[k] = b[index2++];<br />

}<br />

for (k = 0; k < SIZE + SIZE; ++k)<br />

printf("%d ", c[k]);<br />

}<br />

return 0;<br />

214

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!