diff --git a/jlh/src/main/java/com/jlh/viewer/algorithm/MQueue.java b/jlh/src/main/java/com/jlh/viewer/algorithm/MQueue.java
new file mode 100644
index 0000000000000000000000000000000000000000..dd295d175d22a7d1cf37b0a11749cec807124ea3
--- /dev/null
+++ b/jlh/src/main/java/com/jlh/viewer/algorithm/MQueue.java
@@ -0,0 +1,67 @@
+package com.jlh.viewer.algorithm;
+
+import java.util.Arrays;
+
+/**
+ * Created by jlh
+ * On 2017/3/14 0014.
+ */
+public class MQueue {
+    private Integer[] datas;
+    private int front=0;
+    private int back=0;
+    private int store=0;
+    public MQueue(int size) {
+        this.datas = new Integer[size];
+    }
+    public boolean push (int d){
+        if (!isFull()) {
+            datas[back]=d;
+            back=(back+1)%datas.length;
+            store++;
+            return true;
+        }
+        return false;
+    }
+    public Integer pop (){
+        if (!isEmpty()){
+            store--;
+            Integer result=datas[front];
+            front=(front+1)%datas.length;
+            return result;
+        }
+        return null;
+    }
+
+    public boolean isEmpty(){
+        return store==0?true:false;
+    }
+
+    public boolean isFull(){
+        if (store==datas.length)
+            return true;
+        return false;
+    }
+
+    @Override
+    public String toString() {
+        return "MQueue{" +
+                "datas=" + Arrays.toString(datas) +
+                ", front=" + front +
+                ", back=" + back +
+                ", store=" + store +
+                '}';
+    }
+
+    public static void main(String[] args) {
+        MQueue mQueue = new MQueue(4);
+        for (int i=0;i<100;i++){
+            if (!mQueue.push(i)){
+                mQueue.pop();
+                mQueue.push(i);
+            }
+            System.out.println(mQueue);
+        }
+
+    }
+}
diff --git a/jlh/src/main/java/com/jlh/viewer/algorithm/QuickSort.java b/jlh/src/main/java/com/jlh/viewer/algorithm/QuickSort.java
new file mode 100644
index 0000000000000000000000000000000000000000..b64a45bd66cbc59188f36a7946228b856daf58f7
--- /dev/null
+++ b/jlh/src/main/java/com/jlh/viewer/algorithm/QuickSort.java
@@ -0,0 +1,48 @@
+package com.jlh.viewer.algorithm;
+
+import java.util.Random;
+
+/**
+ * Created by jlh
+ * On 2017/3/14 0014.
+ */
+public class QuickSort {
+    public void reslove (int []datas,int l,int r){
+        if (datas.length==0||l>=r)
+            return ;
+        int key= datas[l];
+        int st= l;
+        int ed= r;
+        while (st<ed){
+            while (ed>st && datas[ed]>=key){
+                ed--;
+            }
+            datas[st]=datas[ed];
+            //此处是否有等于号无所谓，因为只要下个while循环至少能跳过那个交换后的值即可
+            while (st<ed &&datas[st] <=key){
+                st++;
+            }
+            datas[ed]= datas[st];
+        }
+        datas[st]=key;
+        reslove(datas,l,st-1);
+        reslove(datas,st+1,r);
+    }
+
+    public static void main(String[] args) {
+        QuickSort quickSort = new QuickSort();
+        int []datas = new int[10];
+        Random random = new Random();
+        for (int i=0;i<datas.length;i++){
+            datas[i]=random.nextInt(100);
+        }
+        for (int i=0;i<datas.length;i++){
+            System.out.print((i==0?"":",")+datas[i]);
+        }
+        quickSort.reslove(datas,0,datas.length-1);
+        System.out.println();
+        for (int i=0;i<datas.length;i++){
+            System.out.print((i==0?"":",")+datas[i]);
+        }
+    }
+}