chore: added c++ explanation

Author: TatsuyaRyujin

lesson_04/evanphilakhong/README.md

@@ -0,0 +1,53 @@
+# Evan Philakhong
+
+## C++ implementation
+
+#### main.hpp
+```c++
+#include <iostream>
+#include <string>
+using namespace std;
+
+// function definition
+bool isPrime(int num);
+```
+#### main.cpp
+```c++
+bool isPrime(int num) {
+    int count = 0;
+        for (int i = num; i > 0; i--) {
+            if (num%i == 0) {
+                count++;
+            }
+        }
+        if (count == 2) {
+            cout << "This is a Prime Number" << endl;
+            return true;
+        }
+    cout << "This is not a Prime Number" << endl;
+    return false;
+}
+```
+
+## Java implementation
+
+```java
+public static boolean isPrime(int num) {
+        int count = 0;
+        for (int i = num; i > 0; i--) {
+            if (num%i == 0) {
+                count++;
+            }
+        }
+        if (count == 2) {
+            System.out.println("This is a Prime Number");
+            return true;
+        }
+        System.out.println("This is not a Prime Number");
+        return false;
+     }
+```
+
+## Explanation
+
+The C++ implementation is using a function named `isPrime` that takes a single parameter `num` representing the number the function is checking if it's a prime number or not. The function returns `True` if the number is **Prime**

lesson_04/evanphilakhong/c++/main.cpp

@@ -1,4 +1,4 @@
-#include "header.hpp"
+#include "main.hpp"
 
 bool isPrime(int num) {
     int count = 0;

lesson_04/evanphilakhong/c++/header.hpp renamed to lesson_04/evanphilakhong/c++/main.hpp

@@ -1,5 +1,4 @@
 #include <iostream>
-#include <string>
 using namespace std;
 
 // function definition