{"id":17961090,"url":"https://github.com/wolverinn/iridescent","last_synced_at":"2025-04-06T04:09:52.803Z","repository":{"id":47304826,"uuid":"227004031","full_name":"wolverinn/Iridescent","owner":"wolverinn","description":"Solid data structure and algorithms","archived":false,"fork":false,"pushed_at":"2022-09-13T00:11:12.000Z","size":2954,"stargazers_count":372,"open_issues_count":4,"forks_count":64,"subscribers_count":11,"default_branch":"master","last_synced_at":"2025-03-30T02:09:40.979Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/wolverinn.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-12-10T01:40:26.000Z","updated_at":"2025-03-16T15:03:44.000Z","dependencies_parsed_at":"2023-01-18T05:30:32.931Z","dependency_job_id":null,"html_url":"https://github.com/wolverinn/Iridescent","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/wolverinn%2FIridescent","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wolverinn%2FIridescent/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wolverinn%2FIridescent/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wolverinn%2FIridescent/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wolverinn","download_url":"https://codeload.github.com/wolverinn/Iridescent/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247430869,"owners_count":20937874,"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":[],"created_at":"2024-10-29T11:08:15.003Z","updated_at":"2025-04-06T04:09:52.675Z","avatar_url":"https://github.com/wolverinn.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Iridescent\nSolid data structure and algorithms in Python\n\n\u003cdiv align=\"center\"\u003e\n\u003cimg src=\"_v_images/20200102113345622_12587.jpg\" width=\"640px\"\u003e\n\u003c/div\u003e\n\n目前进度：数据结构部分已完成，算法部分即将开始完善链表和二叉树相关算法。Star this repo and come back later :）  \n（2022-06更新：终于更新了算法练习的部分）\n\n## Data Structure\n数据结构我跟的主要知识体系是浙江大学的MOOC《[数据结构](https://www.icourse163.org/course/ZJU-93001)》，以及[这个GitHub仓库](https://github.com/jwasham/coding-interview-university/blob/master/translations/README-cn.md)中的数据结构部分\n\n#### [数据结构分析](Data%20Structure.md)\n每种数据结构都用Python实现了常用操作，并分析了时间复杂度（其实通过代码也能分析出来），部分复杂的数据结构（红黑树/B树/堆/哈希表...）有我自己学习过程中的一些理解。完整代码在下面的```ipynb```文件中。\n\n- 数组\n- 链表\n- 堆栈\n- 队列\n    - 循环队列\n- 二叉树\n    - 二叉树的遍历\n- 二叉搜索树\n- 平衡查找树\n    - AVL 树\n    - 红黑树\n    - B树、B+树\n- 堆\n- 字典树\n- 并查集\n- 哈希表\n\n#### [数据结构完整代码实现，含测试用例和注释](Data%20Structure%20code%20complete.ipynb)\n（建议在本地查看```.ipynb```文件，方便运行和页内跳转）\n\n建议自己亲自实现一遍数据结构的所有操作，然后用我写的测试用例运行一下。自己写一遍能够掌握得更牢固。写的时候最好先看原理，理解每种操作怎么实现再自己写，我的代码仅仅作为参考，需要思路的时候再看我的代码，最好不要先看。\n\n## Algorithm\n算法我跟的主要知识体系是 Robert Sedgewick 的《算法-第四版》，以及Coursera上面配套的Princeton的网课。部分知识点已经在数据结构当中用代码实现过了，所以就进行了省略。\n\n大部分算法我都用了 Python 和 Golang 两种语言去实现，这样做不仅是熟悉语言的一种方式，也可以让你对算法对掌握更加牢固，同时如果有些地方不太看得懂，可以试试看另一种语言对实现，说不定能够获得更清晰的思路\n\n#### [算法分析](Algorithms.md)\n* 算法复杂度分析\n* 排序算法\n  * 冒泡排序\n  * 选择排序\n  * 插入排序\n  * 希尔排序\n  * 归并排序\n  * 快速排序\n  * 堆排序\n* 查找\n  * 二分查找\n  * 二叉搜索树\n  * 红黑树\n  * 散列表\n* 链表相关算法\n* 二叉树相关算法\n* 图相关算法\n* 字符串相关算法\n\n#### [算法练习](Algorithm%20practice.ipynb)\n（建议在本地查看```.ipynb```文件，方便运行和页内跳转）\n\n主要是为了方便算法的练习，一些测试代码用的数据结构已经在文件里构造好了。并且只练习最高频最经典的一些算法，方便快速找到手感。\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwolverinn%2Firidescent","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwolverinn%2Firidescent","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwolverinn%2Firidescent/lists"}