void main int i int ar 157 3

  • Slides: 11
Download presentation
אתחול מערך void main() { int i; int ar 1[5]={7, 3, 4, 5,

אתחול מערך void main() { int i; int ar 1[5]={7, 3, 4, 5, 2}; int ar 2[]={9, 3, 3, 4, 6}; /*the size is 5*/ int ar 3[5]={3, 2}; /*the other nums are 0*/ int ar 4[3]; /*garbage*/ int ar 5[100]; /*garbage*/ ar 4[0]=12; ar 4[1]=2; ar 4[2]=9; for (i=0; i<100; i++) ar 5[i]=i+5; }

void main() { 1 int nums[6]; 0 int a=8, b=3; nums[0]=5; nums[2]=a; nums[5]=a+b; nums[b]=nums[2];

void main() { 1 int nums[6]; 0 int a=8, b=3; nums[0]=5; nums[2]=a; nums[5]=a+b; nums[b]=nums[2]; nums[4]=nums[a-b]; nums[a+b]=9; 5 ? } 2 3 4 5 8 8 1111

Selection sort 5 2 1 7 3 5 1 97 9 2 7

Selection sort 5 2 1 7 3 5 1 97 9 2 7

#include <stdio. h> void main() { int i, j, min, temp, nums[10]; for (i=0;

#include <stdio. h> void main() { int i, j, min, temp, nums[10]; for (i=0; i<10; i++){ /*input*/ printf ("enter numbern"); scanf ("%d", &nums[i]); } for (i=0; i<9; i++){ /*main loop*/ min = i; for (j=i+1; j<10; j++) /*finding minimum index*/ if (nums[j]<nums[min]) min = j; temp = nums[i]; /*swaping*/ nums[i] = nums[min]; nums[min] = temp; } for (i=0; i<10; i++) /*printing*/ printf ("%dn", nums[i]); }

Insertion sort 7 3 5 1 9 2

Insertion sort 7 3 5 1 9 2

#include <stdio. h> void main() { int i, j, temp, nums[10]; for (i=0; i<10;

#include <stdio. h> void main() { int i, j, temp, nums[10]; for (i=0; i<10; i++){ /*input*/ printf ("enter numbern"); scanf ("%d", &nums[i]); } for (i=0; i<10; i++){ /*main loop*/ /*finding location of nums[j]*/ for (j=i; j>0 && nums[j]<nums[j-1]; j--){ temp = nums[j]; /*swaping*/ nums[j] = nums[j-1]; nums[j-1] = temp; } } for (i=0; i<10; i++) /*printing*/ printf ("%dn", nums[i]); }

מערך דו מימדי #include <stdio. h> void main() { int i, j; int

מערך דו מימדי #include <stdio. h> void main() { int i, j; int ar 1[3][2]={{1, 2}, {9, 4}, {14, 6}}; int ar 2[][2]={{5, 6}, {7, 4}, {14, 3}}; int ar 3[4][3]={{2}, {1, 1, 1}, {1, 4, 6}}; int ar 4[3][5]; for (i=0; i<3; i++) for (j=0; j<5; j++) scanf("%d", &ar 4[i][j]); }

הגדרות משתנים : שולה המוקשים #include <stdlib. h> #include <time. h> #include <stdio.

הגדרות משתנים : שולה המוקשים #include <stdlib. h> #include <time. h> #include <stdio. h> #define ROWS 10 #define COLS 10 void main() { int i, j, number, mines=0, i 1, j 1, revealed=0; int board[ROWS][COLS]; int player. Board[ROWS][COLS]; srand((unsigned int)time(NULL));

אתחול הלוח : שולה המוקשים for (i=0; i<ROWS; i++){ for (j=0; j<COLS; j++){

אתחול הלוח : שולה המוקשים for (i=0; i<ROWS; i++){ for (j=0; j<COLS; j++){ number=(int)((double)rand()/(RAND_MAX+1)*10); if (number<1){ board[i][j]=1; mines++; } else board[i][j]=0; player. Board[i][j]=9; } }

while (revealed <ROWS*COLS - mines){ for (i=0; i<ROWS; i++){ for (j=0; j<COLS; j++) printf

while (revealed <ROWS*COLS - mines){ for (i=0; i<ROWS; i++){ for (j=0; j<COLS; j++) printf ("%d", player. Board[i][j]); printf("n"); } printf ("enter row and column numbern"); scanf("%d%d", &i 1, &j 1); if (board[i 1][j 1]==1) break; if (player. Board[i 1][j 1]!=9) continue; revealed++; player. Board[i 1][j 1]=0; for (i=max(0, i 1 -1); i<=min(i 1+1, ROWS-1); i++) for (j=max(0, j 1 -1); j<=min(COLS-1, j 1+1); j++) if (board[i][j]) player. Board[i 1][j 1]++; }

תוצאת המשחק : שולה המוקשים if (revealed<ROWS*COLS - mines) printf("KABOOM!!!n"); else printf("You won!!!n");

תוצאת המשחק : שולה המוקשים if (revealed<ROWS*COLS - mines) printf("KABOOM!!!n"); else printf("You won!!!n"); }

void insert First node ptrhead int input voidvoid insert First node ptrhead int input void
C overload swap void swapint int void swapdoubleC overload swap void swapint int void swapdouble
Informal document WP 29 157 26 157 thInformal document WP 29 157 26 157 th
Informal document WP 29 157 24 157 thInformal document WP 29 157 24 157 th
Al Baqarah 154 157 Sapi Betina 154 157Al Baqarah 154 157 Sapi Betina 154 157
include stdio h int main int i intinclude stdio h int main int i int
int main int x 2 int y xint main int x 2 int y x
include stdio h int main int x intinclude stdio h int main int x int
int 5 int 2 main def main defint 5 int 2 main def main def
01 6 swap void swap int A int01 6 swap void swap int A int
int alpha0 void calibrate int center130 right90 left180int alpha0 void calibrate int center130 right90 left180
int inkazu 40 void keisan int keikazu 30int inkazu 40 void keisan int keikazu 30
1 void Xint lines int static blank int1 void Xint lines int static blank int
include stdio h void bar int len intinclude stdio h void bar int len int
public void draw Rectint x int y intpublic void draw Rectint x int y int
7 2 C void select int data int7 2 C void select int data int
include stdio h int stack100 int top0 voidinclude stdio h int stack100 int top0 void
void combine 4vecptr v int dest int ivoid combine 4vecptr v int dest int i
include stdio h int stack100 int top0 voidinclude stdio h int stack100 int top0 void
class Employee int salary int bonus public voidclass Employee int salary int bonus public void
int arr10000 void Binky int i for i0int arr10000 void Binky int i for i0
void fint n int j 0 for intvoid fint n int j 0 for int
unionfind int parentMAXVERTICES int numMAXVERTICES void setinitint nunionfind int parentMAXVERTICES int numMAXVERTICES void setinitint n
Procedural struct Human int height int age voidProcedural struct Human int height int age void
void main int a32767 printfd a Compiled Byvoid main int a32767 printfd a Compiled By
3 1 include stdio h void main int3 1 include stdio h void main int
while include stdio h void main int mwhile include stdio h void main int m
include stdio h void main int i jinclude stdio h void main int i j
include stdio h void main int i charinclude stdio h void main int i char
Lab 6 1 void main int AROWSCOLS 1Lab 6 1 void main int AROWSCOLS 1
1 includestdio h void main int a b1 includestdio h void main int a b
a10 void swap main int a b b8a10 void swap main int a b b8
include stdio h void main int c charinclude stdio h void main int c char
printf include stdio h void main int a1printf include stdio h void main int a1