diff --git a/Algorithm/HeapSort.md b/Algorithm/HeapSort.md
index c29ddf31..a74cbfb1 100644
--- a/Algorithm/HeapSort.md
+++ b/Algorithm/HeapSort.md
@@ -44,7 +44,7 @@
 
 
 
-```
+```java
 public void heapSort(int[] array) {
     int n = array.length;
     
@@ -85,7 +85,7 @@ public void heapSort(int[] array) {
 
 
 
-```
+```java
 public void heapify(int array[], int n, int i) {
     int p = i;
     int l = i*2 + 1;
@@ -132,7 +132,7 @@ public void heapify(int array[], int n, int i) {
 
 ##### 전체 소스 코드
 
-```
+```java
 private void solve() {
     int[] array = { 230, 10, 60, 550, 40, 220, 20 };
  
diff --git a/Algorithm/MergeSort.md b/Algorithm/MergeSort.md
index 791277e5..c7f34118 100644
--- a/Algorithm/MergeSort.md
+++ b/Algorithm/MergeSort.md
@@ -30,7 +30,7 @@
 
 - mergeSort
 
-```
+```java
 public void mergeSort(int[] array, int left, int right) {
     
     if(left < right) {
@@ -58,7 +58,7 @@ public void mergeSort(int[] array, int left, int right) {
 
 - merge()
 
-```
+```java
 public static void merge(int[] array, int left, int mid, int right) {
     int[] L = Arrays.copyOfRange(array, left, mid + 1);
     int[] R = Arrays.copyOfRange(array, mid + 1, right + 1);
@@ -116,7 +116,7 @@ public static void merge(int[] array, int left, int mid, int right) {
 
 
 
-```
+```java
 private void solve() {
     int[] array = { 230, 10, 60, 550, 40, 220, 20 };
  
diff --git a/Algorithm/QuickSort.md b/Algorithm/QuickSort.md
index 44caa9dc..a728f834 100644
--- a/Algorithm/QuickSort.md
+++ b/Algorithm/QuickSort.md
@@ -12,7 +12,7 @@
 
 
 
-```
+```java
 public void quickSort(int[] array, int left, int right) {
     
     if(left >= right) return;
@@ -33,7 +33,7 @@ public void quickSort(int[] array, int left, int right) {
 
 
 
-```
+```java
 public int partition(int[] array, int left, int right) {
     int pivot = array[left];
     int i = left, j = right;
@@ -84,7 +84,7 @@ But,  퀵 정렬도 요소들이 역순으로 존재할 때 최악의 경우로
 
 
 
-```
+```java
 public int partition(int[] array, int left, int right) {
     int mid = (left + right) / 2;
     swap(array, left, mid);
@@ -98,7 +98,7 @@ public int partition(int[] array, int left, int right) {
 
 
 
-```
+```java
 private void solve() {
     int[] array = { 80, 70, 60, 50, 40, 30, 20 };
     quicksort(array, 0, array.length - 1);