{"id":26324916,"url":"https://github.com/c-weiyu/data-structure-algorithm","last_synced_at":"2025-03-15T18:29:13.098Z","repository":{"id":107899053,"uuid":"209701854","full_name":"C-WeiYu/Data-Structure-Algorithm","owner":"C-WeiYu","description":"資料結構與演算法之作品集","archived":false,"fork":false,"pushed_at":"2024-12-02T07:39:10.000Z","size":5798,"stargazers_count":3,"open_issues_count":0,"forks_count":4,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-12-02T08:32:40.413Z","etag":null,"topics":["bst","codesignal","heap-sort","leetcode","merge-sort","quicksort","stack"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/C-WeiYu.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-09-20T03:58:50.000Z","updated_at":"2024-12-02T07:39:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"c13b5730-3a10-4716-b179-686109c224b0","html_url":"https://github.com/C-WeiYu/Data-Structure-Algorithm","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/C-WeiYu%2FData-Structure-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/C-WeiYu%2FData-Structure-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/C-WeiYu%2FData-Structure-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/C-WeiYu%2FData-Structure-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/C-WeiYu","download_url":"https://codeload.github.com/C-WeiYu/Data-Structure-Algorithm/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243774054,"owners_count":20345950,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["bst","codesignal","heap-sort","leetcode","merge-sort","quicksort","stack"],"created_at":"2025-03-15T18:29:12.587Z","updated_at":"2025-03-15T18:29:13.064Z","avatar_url":"https://github.com/C-WeiYu.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n  \u003cimg src=\"http://y3.ifengimg.com/ifengimcp/pic/20150831/ee56b0d7cf6afe54b5b2_size1767_w320_h180.gif\" alt=\"Welcome\" width=\"700\" height=\"250\" border=\"10\" /\u003e\n\u003c/p\u003e\n\n# About Here\n\u003e在這裡記錄我學習程式的過程，不管資料結構與演算法或是其他的作品，\u003c/br\u003e\n之後都會在這裡陸續更新，歡迎大家觀看，喜歡可以點Follow或星星或Fork。\u003c/br\u003e\n- [1.自我介紹](#自我介紹)\n- [2.課堂進度\u0026筆記](#課堂進度筆記)\n- [3.CS50](#cs50)\n- [4.課程心得](#課程心得)\n- [5.相關作品](#作品集)\n# [來點正能量-♫Zootopia](https://www.youtube.com/watch?v=QoXPVSSHzs8) \u003cimg src=\"https://i.ytimg.com/vi/CoSQ4BUqa4k/maxresdefault.jpg\" alt=\"Welcome\" width=\"50\" height=\"30\" border=\"10\" /\u003e\n如電影般的人生，充滿失敗與成功，成為自己的導演，掌控結局\n## 自我介紹:   \n\u003cimg src=\"https://github.com/C-WeiYu/WeiYu/blob/master/S__146874373.jpg\" width=\"180\" height=\"180\"\u003e\u003c/br\u003e\n\u003e大家好我叫莊崴宇，目前就讀東吳大學巨資三B\u003c/br\u003e\n對我而言課業是種負擔，而從課業中尋求樂趣藉此投入才是中心\u003c/br\u003e\n在學習程式設計這方面狀況並不樂觀，但我享受解開問題的瞬間\u003c/br\u003e\n喜歡充滿挑戰的人生，沉浸於成功後的愉悅與光榮，這就是我\u003c/br\u003e\n## 課堂進度\u0026筆記:\n**(因避免排版過於雜亂，以連結網頁內容表示上課內容)**\n### Week1\n- 停課\n### Week2:Linked List\n\u003e講解Linked List的基本性質及Node的組成\n- [Introduce Linked List](https://www.youtube.com/watch?v=WwfhLC16bis\u0026feature=emb_logo)\n- [About Leetcode](https://leetcode.com/problemset/all/)\n- [About Codesignal](https://codesignal.com/)\n- [x] [MY Linked list](https://github.com/C-WeiYu/Data-Structure-Algorithm/blob/master/Leetcode/707_Design%20Linked%20List_06170201.py)\n### Week3:Stack and Queue\n\u003e接連著上禮拜的Linked List，延伸至Stack與Queue結構，並講解兩者的差異\n- [補充 : About Stack](http://alrightchiu.github.io/SecondRound/stack-introjian-jie.html)\n- [補充 : About Queue](http://alrightchiu.github.io/SecondRound/priority-queueintrojian-jie.html)\n- [Maze By Stack](https://www.youtube.com/watch?v=yCQLluCn3rc\u0026feature=emb_logo)\n- [x] [My Stack](https://github.com/C-WeiYu/WeiYu/blob/master/Leetcode/class/155.Min%20Stack.py)\n- [x] [My Queue](https://github.com/C-WeiYu/WeiYu/blob/master/Leetcode/class/232.%20Implement%20Queue%20using%20Stacks.py)\n### Week4:InsertionSort and QuickSort\n\u003e演習課補充了InsertionSort的規則與示範，正課則講解QuickSort的運作方法\n- [Set By Teacher](https://github.com/pecu/DSA/blob/master/03_Set/set-mismatch.py)\n- [Set Exercise](https://leetcode.com/problems/set-mismatch/)\n- [About Insertion Sort](http://notepad.yehyeh.net/Content/Algorithm/Sort/Insertion/1.php)\n- [Bubble Sort vs Quick Sort](https://www.youtube.com/watch?v=G4dwRF_Rzd0\u0026feature=emb_logo)\n- [x] [My Quick Sort](https://github.com/C-WeiYu/WeiYu/blob/master/HW1/QuickSort.ipynb)\n### Week5\n- 放假\n### Week6:QuickSort and HeapSort\n\u003e除了補充上上星期的QuickSort外，講了關於HeapSort的運作方法，初次踏入了Tree結構\u003c/br\u003e\n演習課的部分教了如何使用Spyder去增加Debug的效率\n- [補充 : About Quick Sort](http://alrightchiu.github.io/SecondRound/comparison-sort-quick-sortkuai-su-pai-xu-fa.html)\n- [補充 : About Heap Sort](http://alrightchiu.github.io/SecondRound/comparison-sort-heap-sortdui-ji-pai-xu-fa.html)\n- [Spyder Debug Mode](https://docs.spyder-ide.org/debugging.html)\n- [Python Code](https://realpython.com/python-pep8/?fbclid=IwAR1olxlNcAQhKZVNw6-JBCituCKsqfk3YL67xOMfQA-_fyqbHyrFJRm15T4)\n- [x] [My Heap Sort](https://github.com/C-WeiYu/WeiYu/blob/master/HW2/heap_sort_06170201.py)\n### Week7:Merge Sort\n\u003e講解MergeSort的運作方法並補充了HeapSort的資料結構\n- [Heap Sort](https://algorithm.yuanbin.me/zh-tw/basics_data_structure/heap.html)\n- [Merge Sort](https://www.c-programming-simple-steps.com/merge-sort.html)\n- [Merge Sort:Pseudocode](https://www.slideshare.net/MJabin/merge-sort-and-quick-sort)\n- [Merge Sort vs Quick Sort](https://www.youtube.com/watch?time_continue=1\u0026v=es2T6KY45cA\u0026feature=emb_logo)\n- [x] [My Merge Sort](https://github.com/C-WeiYu/WeiYu/blob/master/HW2/merge_sort_06170201.py)\n### Week8:Binary Tree By Linked List\n\u003e正式踏入Tree結構，並講解如何用Linked List去理解Binary Tree\n- [What are Trees](https://www.tutorialride.com/data-structures/trees-in-data-structure.htm)\n- [Binary Tree](http://alrightchiu.github.io/SecondRound/binary-tree-introjian-jie.html)\n- [Binary Tree Structure](http://www.math.bas.bg/~nkirov/2017/NETB201/slides/ch06/ch06-2.html)\n- [Binary Tree Structure_YT](https://www.youtube.com/watch?time_continue=150\u0026v=ikPPdBDZnz4\u0026feature=emb_logo)\n### Week9:Binary Search Tree\n\u003e 講解Binary Search Tree，並分辨Binary Search Tree與 Binary Tree的差別\n- [Binary Tree vs Binary Search Tree](https://www.youtube.com/watch?v=7vw2iIdqHlM\u0026feature=emb_logo)\n- [Search and Insert](http://alrightchiu.github.io/SecondRound/binary-search-tree-searchsou-xun-zi-liao-insertxin-zeng-zi-liao.html)\n- [補充 : Delete](http://alrightchiu.github.io/SecondRound/binary-search-tree-sortpai-xu-deleteshan-chu-zi-liao.html)\n- [x] [My Binary Search Tree](https://github.com/C-WeiYu/WeiYu/blob/master/HW3/binary_search_tree_06170201.py)\n### Week10:Red Black Tree\n\u003e延續Binary Search Tree，以Red Black Tree解決BST不平衡的問題\n- [Red Black Tree Rule](https://yotsuba1022.gitbooks.io/data-structure-note/content/1.4.3-red-black-tree.html)\n- [Rotation](https://en.wikipedia.org/wiki/Tree_rotation)\n- [About Black Tree](http://www.ciaoshen.com/algorithm/2018/11/09/red-black-tree.html)\n- [Complexity](https://subscription.packtpub.com/book/application_development/9781786463890/6/ch06lvl1sec63/complexity-of-different-tree-data-structures)\n- [Practice Page](https://www.cs.usfca.edu/~galles/visualization/RedBlack.html)\n### Week11:Hash Table\n\u003e講解Hash Function的目的與Hash Table的使用方法及目的\n- [What is Hash Table](https://en.wikipedia.org/wiki/Hash_table)\n- [Hash Set](https://www.cs.wcupa.edu/rkline/ds/hash-sets.html)\n- [Hash Function](https://themoneymongers.com/bitcoin-hash/)\n- [進位制](/pic/hash.jpg)\n### Week12:Breadth-First Search\n\u003e介紹Bredth-First Search的運作方法\n- [About BFS](http://alrightchiu.github.io/SecondRound/graph-breadth-first-searchbfsguang-du-you-xian-sou-xun.html)\n- [BFS By Queue](https://www.programiz.com/dsa/graph-bfs)\n- [Pair Programming](https://www.youtube.com/watch?v=vgkahOzFH2Q\u0026feature=youtu.be)\n- [補充 : Graph](http://www.csie.ntnu.edu.tw/~u91029/Graph.html)\n### Week13:Depth-First Search\n\u003e介紹Depth-First Search的運作方法並和BFS比較\n- [About DFS](http://alrightchiu.github.io/SecondRound/graph-depth-first-searchdfsshen-du-you-xian-sou-xun.html)\n- [DFS Step By Step](https://www.javatpoint.com/breadth-first-search-algorithm)\n- [DFS PseudoCode](https://www.youtube.com/watch?v=GFlthbUd7LQ\u0026feature=youtu.be)\n- [DFS vs BFS](https://github.com/C-WeiYu/WeiYu/blob/master/pic/BFS%20vs%20DFS.md)\n- [x] [My BFS and DFS](https://github.com/C-WeiYu/WeiYu/blob/master/HW5/BFS_06170201.py)\n### Week14:Minimum Spanning Tree - Kruskal\n\u003e講解Kruskal的運作方法及使用目的\n- [About Kruskal](https://zh.wikipedia.org/wiki/%E5%85%8B%E9%B2%81%E6%96%AF%E5%85%8B%E5%B0%94%E6%BC%94%E7%AE%97%E6%B3%95)\n- [Kruskal Step By Step](https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/)\n- [Maze By Kruskal](https://codereview.stackexchange.com/questions/197356/searching-a-maze-using-dfs-and-bfs-in-python-3)\n- [Informations](https://github.com/C-WeiYu/WeiYu/blob/master/Kruskal_inf.md)\n### Week15:Shortest Path - Dijkstra\n\u003e講解Dijkstra的運作方法及使用目的並和Kruskal比較\n- [Dijkstra Step By Step](https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/)\n- [x] [My Kruskal and Dijkstra](https://github.com/C-WeiYu/WeiYu/blob/master/HW6/Dijkstra_06170201.py)\n### Week16\n- 總複習\u003c/br\u003e\n- \u003ca href=\"/pic/life.jpg\"\u003e\u003cimg src=\"/pic/life.jpg\" border=\"0\" width=\"100\" height=\"70\"\u003e\u003c/a\u003e\n### Week17\n- 期末考\n### Week18\n- 停課\n## CS50:\n## 課程心得:\n這堂課應該是人生中最煩惱但也最充實的一堂課了，雖然說每個作業都有兩個星期的時間去寫，但卻也整整花了兩個禮拜天每熬夜都三四點才可以把程式碼實現，對我來說這堂課很辛苦也值得，雖然作業經常拿到滿分，但光芒背後有著多少的陰影是大家不知道的，我的程式能力不好，甚至我自己覺得比一半的人都差，所以過程中比別人加倍努力，就像老師常說的，可怕的不是別人比你聰明，而是聰明的人比你更努力，我也常常警惕著自己，也許自己做不到最好，至少要努力追上別人的腳步。\u003c/br\u003e\n過程中有哭有笑，還記得一開始大家完全沒辦法接受的上課過程與作業規則到後來老師、助教、同學互相討論，以討論取代情緒，一切漸漸走上軌道，我覺得這是一個很難得也很神奇的事情，或許就是因為一直以來都是老師說一就是一的教育，所以當過程過於艱難的時候就會想要放棄，但這堂課有著不同情境，老師跟學生之間彷彿有一墩橋樑建立，整個學習環境也漸漸改善，我覺得這是讓很多人不選擇放棄退選的原因，也謝謝老師跟助教過程中的教導、包容。\u003c/br\u003e\n對我來說大三的這堂資料結構與演算法，雖然課程內容一直圍繞著演算法，但更重要的是這堂課所改變的人事物，半年前的我不是一個會自動去寫程式碼的人，甚至每次有程式碼的作業就會覺得很無聊，希望老師不會用太難的程式碼來考，但經過這堂課的洗滌後我找到了對程式碼隱含的一點熱忱，當學會怎麼把自己的想法以程式碼實現之後就會發現其實並不排斥程式碼，排斥的是把程式碼當歷史文學般背誦的錯路，雖然在體會那種成就那種爽感前要付出的很多，就連跨年夜都要自己在家繼續打code，別人還不能了解你到底在忙什麼，我很清楚，這種過程大概只有修過這堂資料結構與演算法的同學們可以理解，這是巨資大三的共同回憶吧。\u003c/br\u003e\n最後要謝謝老師所設計的課程內容，雖然過程真的艱辛無比，但改變了很多事情，而我們也還沒溺斃；也謝謝助教，一開始看到熬夜寫到三四點的作業被改抄襲的時候心中真的是OOXX，但後來也漸漸了解了這個制度的用意，很多事就像這些成績一樣，不主動去爭取就無形中被奪走了，但主動爭取之後改拿到的終究會拿到；最後也謝謝在這堂課一起成長的同學，過程中受人幫助很多，不管是程式碼的幫忙或是互相抱怨的過程。\u003c/br\u003e\n「如果明天是生命的最後一天，今天會用什麼樣的態度來活著?」不敢說會做多麼偉大多麼瘋狂的事，至少讓某個世界因為自己而有一點的不同。\n## 作品集:\n### 資料結構與演算法\n- [x] [HW1:QuickSort](https://github.com/C-WeiYu/WeiYu/tree/master/HW1)\n- [x] [HW2:MergeSort and HeapSort](https://github.com/C-WeiYu/WeiYu/tree/master/HW2)\n- [x] [HW3:Binary Search Tree](https://github.com/C-WeiYu/WeiYu/tree/master/HW3)\n- [x] [HW4:Hash Table](https://github.com/C-WeiYu/WeiYu/tree/master/HW4)\n- [x] [HW5:BFS and DFS](https://github.com/C-WeiYu/WeiYu/tree/master/HW5)\n- [x] [HW6:Dijkstra and Kruskal](https://github.com/C-WeiYu/WeiYu/tree/master/HW6)\n### [CodeSignal](https://github.com/C-WeiYu/WeiYu/tree/master/CodeSignal)\n\u003e 陸續將自己程式基礎補齊的足跡\n### [LeetCode](https://github.com/C-WeiYu/LeetCode.git)\n\u003e 裡面有我在LeetCode慢慢累積的點滴\n### HTML\n\u003e 放上關於我在大學所做的html\n- [x] [Chocolate Worlde(Encoding with Big5)](https://c-weiyu.github.io/GoogleAnalytic_Chocolate-World/)\n- [x] [CS:GO Analysis(Encoding with utf-8)](https://c-weiyu.github.io/Visualize_CSGO-Analysis/)\n## 學習之地:\n\u003e 課外學習\n+ [Data Science Meetup台灣資料科學社群](https://www.facebook.com/groups/1356636874425968/)\u003c/br\u003e\n+ [What is Bigdata](https://www.managertoday.com.tw/articles/view/52306)\u003c/br\u003e\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fc-weiyu%2Fdata-structure-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fc-weiyu%2Fdata-structure-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fc-weiyu%2Fdata-structure-algorithm/lists"}