이미안녕

1. Several representatives conducted on-the-spot interviews with customers to obtain feedback on store employee service.

escoted 호위하다, 바래다 주다

operate 작용하다, 운영하다

conduct 시행하다, 행동하다

transfer 옮기다 전달하다

2. We submitted a proposal for 3-month project aimed at replacing the damaged sidewalks of the community.

proposal 제안서, 제안

sidewalk 보도, 인도

3. It was difficult to spot the HRD head standing among the other members of management as they were all similarly dressed.

between ~둘 사이에

among (셋 이상의 사물/사람) ~사이에, ~에 둘러싸여

outside ~겉에, ~의 바깥에

through ~을 지나서, ~을 토앟여

similarly 비슷하게, 유사하게

spot 발견하다, 분간하다.

1. Patricia must submit her application to the person collecting the forms before she leaves the office

Patricia 는 그녀가 사무실을 떠나기 전에 그 양식을 받는 사람에게 그녀의 신청서를 제출해야만 한다.

2. Miriam is happy with her new factory assignment as it is less repetitive than the previous work she was doing.

Miriam 은 그넛은 그녀가 하고 있었던 이전 업무보다 덜 반복적이기 때문에 자신의 새로운 공장 업무에 만족한다.

3. The agency's tour of the French countryside is so delightful that visitors who have joined it befor often sign up again.

그 대행사의 프랑스 시골 지역 관광은 매우 즐거워서 전에 참가했던 방문객들이 종종 다시 신청한다.

#include <stdio.h>
#include <unistd.h>
#pragma pack(push, 1) // 1 바이트 크기로 정렬
struct str_pack {
	char flags;
	int seq;
};
#pragma pack(pop) // 정렬 설정을 이저너ㅓ 상태 (기본값) 로 되돌림

union packet {
	int num;
	char empty;
};

union packet_empty {
	int num;
	char empty[0];
};

struct str_first {
	char a;
	int num_a;
	char b;
};

union uni_first {
	int num_a;
	int num_b;
};

union uni_second {
	int a;
	char b;
	double d;
	int arr[3];
};

struct Person1 {
	char name[20];
	double age;
	char sex;
};

struct Person2 {
	char name[20];
	char sex;
	double age;
};

int main()
{
	printf("PAGE_SIZE = %d\n", getpagesize());

	int i;
	int *ip;
	char ch;
	char *chp;
	char arrays[10];
	char empty[0];
	union packet pk;
	union packet_empty pk_empty;
	int int_array4[4];

	struct str_first v_str_first;
	union uni_first v_uni_first;

	pk.num = 4;
	pk.empty = 'c';
	//pk_empty.empty = "c";


	printf("sizeof(int i) = %ld\n", sizeof(i));
	printf("sizeof(int *i) = %ld\n", sizeof(ip));
	printf("sizeof(char ch) = %ld\n", sizeof(ch));
	printf("sizeof(char *chp) = %ld\n", sizeof(chp));
	printf("sizeof(char arrays[10]) = %ld\n", sizeof(arrays[10]));
	printf("sizeof(char empty[0]) = %ld\n", sizeof(empty[0]));
	printf("sizeof(union packet) = %ld\n", sizeof(union packet));
	printf("sizeof(union packet) = %ld\n", sizeof(union packet));

	printf("sizeof(int_array4) = %ld\n", sizeof(int_array4));
	printf("sizeof(int_array4[0]) = %ld\n", sizeof(int_array4[0]));

	printf("\n============ Struct Size =============\n\n");

	printf("sizeof(struct str_first) = %ld\n", sizeof(struct str_first));
	printf("sizeof(struct str_first v_str_first) = %ld\n", sizeof(v_str_first));
	printf("sizeof(union uni_first) = %ld\n", sizeof(union uni_first));
	printf("sizeof(union uni_first v_uni_first) = %ld\n", sizeof(v_uni_first));
	printf("sizeof(union uni_second) = %ld\n", sizeof(union uni_second));
	printf("sizeof(struct Person1) = %ld\n", sizeof(struct Person1));
	printf("sizeof(struct Person2) = %ld\n", sizeof(struct Person2));

	v_uni_first.num_a = 4;

	printf("%d\n", v_uni_first.num_a);
	printf("%d\n", v_uni_first.num_b);

	return 0;
}

#include <stdio.h>

void reverse(int nums[], int size, int start, int end) {
	while (start < end) {
		int temp = nums[start];
		nums[start] = nums[end];
		nums[end] = temp;
		start++;
		end--;
	}
}

void rotate(int nums[], int size, int k) {

	k = k % size;
	reverse(nums, size, 0, k-1);
	reverse(nums, size, k, size-1);
	reverse(nums, size, 0, size-1);
}


int main() {
	int arr[10] = {0,1,2,3,4,5,6,7,8,9};
	int size = 10;
	int i, j;

	for (i = 0; i < 10; i++) {
		printf("%d ", arr[i]);
	}
	printf("\n");

	// reverse(arr, size, 0, 9);
	rotate(arr, size, 2);

	for (i = 0; i < 10; i++) {
		printf("%d ", arr[i]);
	}
	printf("\n");

	return 0;
}

#include <stdio.h>

void swap(int data[], int a, int b) {
	int temp = 0;
	temp = data[a];
	data[a] = data[b];
	data[b] = temp;
}

int partition(int data[], int left, int right) {
	int pivot = data[left];
	int low = left +1;
	int high = right;

	while (low <= high)
	{
		while (low <= right && pivot >= data[low])
			low++;
		while (high >= (left+1) && pivot <= data[high])
			high--;

		if (low <= high) {
			swap(data, low, high);
		}
	}

	swap(data, left, high);
	return high;
}

void quick_select(int data[], int left, int right, int k) {
	int pivot = 0;
	if (left >= right) {
		return;
	}

	pivot = partition(data, left, right);

	if (pivot == k)
		return;
	else if (pivot > k)
		quick_select(data, left, pivot -1, k);
	else if (pivot < k)
		quick_select(data, pivot +1, right, k);
}

int main(void) {
	
	int i = 0;
	int data[100];
	int n = 0;
	int k = 0;

	printf("number = ?\n");
	scanf("%d", &n);

	printf("k = ?\n");
	scanf("%d", &k);

	srand(time(NULL));
	for (i = 0; i < n; i++) {
		data[i] = rand()%1000;
	}

	printf("before\n");
	for (i = 0; i < n; i++) {
		printf("%d ", data[i]);
	}
	printf("\n");

	quick_select(data, 0, n-1, k);

	printf("after\n");
	for (i = 0; i < n; i++) {
		printf("%d ", data[i]);
	}
	printf("\n");

	return 0;
}

#include <stdio.h>

void swap(int data[], int a, int b) {
	int temp = 0;
	temp = data[a];
	data[a] = data[b];
	data[b] = temp;
}

int partition(int data[], int left, int right) {
	int pivot = data[left];
	int low = left +1;
	int high = right;

	while (low <= high)
	{
		while (low <= right && pivot >= data[low])
			low++;
		while (high >= (left+1) && pivot <= data[high])
			high--;

		if (low <= high) {
			swap(data, low, high);
		}
	}

	swap(data, left, high);
	return high;
}

void quick_sort(int data[], int left, int right) {
	int pivot = 0;
	if (left >= right) {
		return;
	}

	pivot = partition(data, left, right);
	quick_sort(data, left, pivot -1);
	quick_sort(data, pivot +1, right);
}

int main(void) {
	
	int data[10] = {0,2,4,6,8,1,3,5,7,9};
	int n = 10;
	int i = 0;

	quick_sort(data, 0, n-1);

	for (i = 0; i < n; i++) {
		printf("%d ", data[i]);
	}
	printf("\n");

	return 0;
}

1. The professor doesn't like being interrupted, so students listen quietly until the floor is open for questions.

quietly : 조용히

2. The client asked the contractor to finalize the agreement, but some of the contract terms were still unclear to the service provider.

contractor : 계약자, 도급업자

contract terms : 계약 조건

3. Some of the hotel staff are busily preparing the suite for the arrival of a diplomat from Angola.

diplomat : 외교관

arrival : 도착

arriver : 도착자

1. The large number of participating in the project made it difficult to organize the numerous tasks involved.

organize : 체계화하다, 정리하다, 조직하다

2. The employee in charge of the lost and found department said that any items not claimed within three months are disposed of.

seclude : 은둔하다, 고립시키다

dispose of : ~을 처분하다, 처리하다.

3. After several investors withdrew, the managers had no choice but to suspend the project until sufficient capital was made available.

withdraw : 중단하다, 철수하다

1. A customer dropped by the store's gift-wrapping service but couldn't find anyone at the counter.

drop by : 잠깐 들르다

gift-wrapping : 선물 포장

2. Trucks are not permitted on the narrowest street in town, as it can only be traversed by the smallest cars.

traverse : 통과하다, 가로지르다

3. Because of a delay at the port of origin, the flight from Brussels is not expected to arrive until 20 minutes past noon.

Unless : ~ 하지 않는 한

Despite : ~ 에도 불구하고

port of origin : 발항지

1. Jenny Bell is a steady and dependable worker and can be relied on to finish any task even under pressure.

durable : (의상, 재료가) 내구성이 있는, 오래가는

pertinent : (상황에) 적절한, 관련 있는

2. Production at the car accessories plant is at its peak when new models are introduced but drops to regular levels six months after.

production : 생산량

3. The store frequently changes its display window to keep its look updated and to stay appealing to shoppers in the mall.

relativley : 비교적

marginally : 아주 조금, 미미하게

appealing : 매력적인