From 3266f54a4e463c9c610b274e0f66744a5cd80751 Mon Sep 17 00:00:00 2001
From: Wen Yao Jin <wen-yao.jin@student.ecp.fr>
Date: Sat, 11 Mar 2017 21:49:13 +0100
Subject: [PATCH] Update BDPA_Assign2_WJIN.md

---
 BDPA_Assign2_WJIN.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/BDPA_Assign2_WJIN.md b/BDPA_Assign2_WJIN.md
index 8f69dfb..72ff5b3 100644
--- a/BDPA_Assign2_WJIN.md
+++ b/BDPA_Assign2_WJIN.md
@@ -250,6 +250,7 @@ To avoid redundant parses of the input file, some intuition is needed. In this a
 * The two instances are exactly the two documents that we need to compare for each key. Calculate similarity and emit key pairs that are similar.  
 
 Following code can be found [here](src/similarity/NaiveApproach.java).
+
 **Mapper:**
 ```java
       @Override
@@ -346,6 +347,7 @@ In this part, the implementation is more trivial:
 * At reduce phase, for each key, compute similarity if severals document id are represented. Since the words are sorted by frequency, ideally there will be much less comparaison needed
 
 Following code can be found [here](src/similarity/PrefilteringApproach.java).
+
 **Mapper:**
 ```java
 @Override
-- 
GitLab