๐Ÿ’ป Dev & CSC++ Programming

C++ Programming Ch.10 Exercise 2 Solution

Problem: ๋‘ ๊ฐœ์˜ ๋ฐฐ์—ด์„ ๋น„๊ตํ•˜์—ฌ ๊ฐ™์œผ๋ฉด true๋ฅผ, ์•„๋‹ˆ๋ฉด false๋ฅผ ๋ฆฌํ„ดํ•˜๋Š” ์ œ๋„ค๋ฆญ ํ•จ์ˆ˜ equalArrays()๋ฅผ ์ž‘์„ฑํ•˜๋ผ. ๋˜ํ•œ main() ํ•จ์ˆ˜๋ฅผ ์ž‘์„ฑํ•˜์—ฌ equalArrays()๋ฅผ ํ˜ธ์ถœํ•˜๋Š” ๋ช‡ ๊ฐ€์ง€ ์‚ฌ๋ก€๋ฅผ ๋ณด์—ฌ๋ผ. equalArrays()๋ฅผ ํ˜ธ์ถœํ•˜๋Š” ์ฝ”๋“œ ์‚ฌ๋ก€๋Š” ๋‹ค์Œ๊ณผ ๊ฐ™๋‹ค. 1 2 3 4 5 6 int x[] = {1, 10, 100, 5, 4}; int y[] = {1, 10, 100, 5, 4}; if(equalArray(x, y, 5)) cout << "๊ฐ™๋‹ค"; // ๋ฐฐ์—ด x, y๊ฐ€ ๊ฐ™์œผ๋ฏ€๋กœ "๊ฐ™๋‹ค" ์ถœ๋ ฅ else cout << "๋‹ค๋ฅด๋‹ค"; Execution Result: ...

March 9, 2020 ยท 1 min ยท Sobamemil
๐Ÿ’ป Dev & CSC++ Programming

C++ Programming Ch.10 Exercise 1 Solution

Problem: ๋ฐฐ์—ด์„ ๋ฐ›์•„ ๊ฐ€์žฅ ํฐ ๊ฐ’์„ ๋ฆฌํ„ดํ•˜๋Š” ์ œ๋„ค๋ฆญ ํ•จ์ˆ˜ biggest()๋ฅผ ์ž‘์„ฑํ•˜๋ผ. ๋˜ํ•œ main() ํ•จ์ˆ˜๋ฅผ ์ž‘์„ฑํ•˜์—ฌ biggest()๋ฅผ ํ˜ธ์ถœํ•˜๋Š” ๋ช‡ ๊ฐ€์ง€ ์‚ฌ๋ก€๋ฅผ ๋ณด์—ฌ๋ผ. Execution Result: Objective & Hints: ํ…œํ”Œ๋ฆฟ ํ•จ์ˆ˜ ๋งŒ๋“ค๊ธฐ biggest()๋ฅผ ํ˜ธ์ถœํ•˜๋Š” ์ฝ”๋“œ ์‚ฌ๋ก€๋Š” ๋‹ค์Œ๊ณผ ๊ฐ™๋‹ค. 1 2 int x[] = {1, 10, 100, 5, 4}; cout << biggest(x, 5) << endl; // 5๋Š” ๋ฐฐ์—ด x์˜ ํฌ๊ธฐ. 100์ด ์ถœ๋ ฅ๋œ๋‹ค. Code: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 #include using namespace std; template T biggest(T a[], T n){ T big = a[0]; // ๋ฐฐ์—ด a์˜ ์ฒซ๋ฒˆ์งธ ์›์†Œ๋ฅผ big์— ์‚ฝ์ž… for(T i=1; i<n; i++) big = big < a[i] ? a[i] : big; // big๋ณด๋‹ค a[i]์˜ ๊ฐ’์ด ๋” ํฌ๋ฉด big์— a[i]์˜ ๊ฐ’์„ ์‚ฝ์ž… return big; } int main() { int big = 0; int x[] = {1, 10, 100, 5, 4}; cout << biggest(x, 5) << endl; } Explanation: ...

March 9, 2020 ยท 1 min ยท Sobamemil