ingbeeni

// 날짜 : 2014-09-26// 수업 : C++ Programming// 학과 : 컴퓨터공학과// 이름 : 김정빈 #include#includeusing namespace std; class Circle{private:int radius;public:Circle(){radius = 1;cout

#include#include#define MAX_SIZE 10void insertion_sort(int *arr, int n); int main(void){int i,n;int arr[MAX_SIZE];n = MAX_SIZE;for ( i=0; i

#include#include #define SWAP(a,b,t)( (t)=(a), (a)=(b) , (b)=(t));#define MAX_SIZE 100; void selection_sort(); int main(void){int i,n;n = MAX_SIZE;int arr[]={0};for(i = 0; i

/* date : 2014-09-19 * * class : C++ Programming * * Student ID : 5112648 * * name : 김정빈 * */ #include // std와

19. #include // std와

#include class Circle{private:int rad;public:Circle(int r){rad = r;}double getarea(){return 3.14 * rad * rad;}}; int main(void){Circle a(6),b(7),c(8);std::cout

#include#include #define MAX_QUEUE_SIZE 100 typedef struct TreeNode{int data;struct TreeNode *left, *right;}TreeNode; TreeNode n1={1 , NULL, NULL};TreeNode n2={4 , &n1, NULL};TreeNode n3={16 , NULL, NULL};TreeNode n4={25 , NULL, NULL};TreeNode n5={20 , &n3, &n4};TreeNode n6={15 , &n2, &n5};TreeNode *root=&n6; int get_node_count(TreeNode *root){int count =0;if( root != NULL)count = 1 + get_node_c..

#include#include #define MAX_QUEUE_SIZE 100 typedef struct TreeNode{int data;struct TreeNode *left, *right;}TreeNode;typedef TreeNode *element;typedef struct{element queue[MAX_QUEUE_SIZE];int front, rear;}QueueType; TreeNode n1={1 , NULL, NULL};TreeNode n2={4 , &n1, NULL};TreeNode n3={16 , NULL, NULL};TreeNode n4={25 , NULL, NULL};TreeNode n5={20 , &n3, &n4};TreeNode n6={15 , &n2, &n5};TreeNode ..

#include#include typedef int element;typedef struct node{element data;struct node *left, *right;}Treenode; /*Treenode n1= {1, NULL, NULL};Treenode n2= {4, &n1, NULL};Treenode n3= {16, NULL, NULL};Treenode n4= {25, NULL, NULL};Treenode n5= {20, &n3, &n4};Treenode n6= {15, &n2, &n5};Treenode *root =&n6;*/ void init_node(Treenode *root){root->data = 0;root->left = NULL;root->right =NULL;}void creat..

#include#include #define MAX_NODE_SIZE 10typedef char element; void error(char *message);void insert_node(element *node);void search_node(element *node);void search_children(element *node);void display_node(element *node); int main(void){element NODE[MAX_NODE_SIZE]= {0};//printf("%d",'a'); insert_node(NODE);display_node(NODE);search_node(NODE);//search_children(&NODE); return 0;} void error(char..