{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":260388831,"defaultBranch":"master","name":"AlgorithmsAndDataStructure","ownerLogin":"Py-Contributors","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2020-05-01T05:46:35.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/71255822?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1666620129.002801","currentOid":""},"activityList":{"items":[{"before":"1ae564af45a81306bfae8822003aac8b8f5f0149","after":"3fad8057d87ee366b8a1db5650cea97b61db9e1a","ref":"refs/heads/master","pushedAt":"2024-05-07T02:35:48.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"radix sort (#970)\n\n* Create Breadth-First Search (BFS) Searching.java\r\n\r\nSigned-off-by: pojith raj R <126692672+pojith@users.noreply.github.com>\r\n\r\n* Update Breadth-First Search (BFS) Searching .java\r\n\r\nSigned-off-by: pojith raj R <126692672+pojith@users.noreply.github.com>\r\n\r\n* Bucket sort\r\n\r\nSigned-off-by: pojith raj R <126692672+pojith@users.noreply.github.com>\r\n\r\n* Heap sort\r\n\r\nSigned-off-by: pojith raj R <126692672+pojith@users.noreply.github.com>\r\n\r\n* radix sort\r\n\r\nSigned-off-by: pojith raj R <126692672+pojith@users.noreply.github.com>\r\n\r\n---------\r\n\r\nSigned-off-by: pojith raj R <126692672+pojith@users.noreply.github.com>","shortMessageHtmlLink":"radix sort (#970)"}},{"before":"c827c50da040ffc7da357c1dc781f835de82a3e9","after":"1ae564af45a81306bfae8822003aac8b8f5f0149","ref":"refs/heads/master","pushedAt":"2024-03-13T17:42:40.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Inserted a Linear Searching algorithm example (#956)","shortMessageHtmlLink":"Inserted a Linear Searching algorithm example (#956)"}},{"before":"7d8517daeca91130a21435136e8d8a165b6288b0","after":"c827c50da040ffc7da357c1dc781f835de82a3e9","ref":"refs/heads/master","pushedAt":"2023-11-12T04:33:35.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"add inorder and postorder traversal for cpp (#951)","shortMessageHtmlLink":"add inorder and postorder traversal for cpp (#951)"}},{"before":"9507e5bba649edc9fcb2490d57884e99bb56fee8","after":"7d8517daeca91130a21435136e8d8a165b6288b0","ref":"refs/heads/master","pushedAt":"2023-09-07T02:17:00.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Issue 945 (#948)","shortMessageHtmlLink":"Issue 945 (#948)"}},{"before":"6b9b8b0dfe4543ec2ca191a5290415e36ae06dbd","after":"9507e5bba649edc9fcb2490d57884e99bb56fee8","ref":"refs/heads/master","pushedAt":"2023-09-03T05:23:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Update README.md\n\nSigned-off-by: Deepak Raj <54245038+codeperfectplus@users.noreply.github.com>","shortMessageHtmlLink":"Update README.md"}},{"before":"a51bdffb1295de0af864952588b8feda37b45c09","after":"6b9b8b0dfe4543ec2ca191a5290415e36ae06dbd","ref":"refs/heads/master","pushedAt":"2023-08-15T05:11:49.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Dynamic programming (#944)\n\n* Dynamic programming\r\n\r\n* Changes\r\n\r\n* removed executable files","shortMessageHtmlLink":"Dynamic programming (#944)"}},{"before":"7d7b56c6ab6986724e7b2f67e4bc7b289e3d17c0","after":"a51bdffb1295de0af864952588b8feda37b45c09","ref":"refs/heads/master","pushedAt":"2023-07-12T02:23:51.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Update README.md (#941)\n\nSigned-off-by: Sreya Ramachandran <123823639+sreyaarc@users.noreply.github.com>","shortMessageHtmlLink":"Update README.md (#941)"}},{"before":"560565ae37c1e13572947026ead8bc6aa17ea991","after":"7d7b56c6ab6986724e7b2f67e4bc7b289e3d17c0","ref":"refs/heads/master","pushedAt":"2023-07-06T03:33:03.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Add Comb Sort Algorithm in Javascript/Algorithms (#939)","shortMessageHtmlLink":"Add Comb Sort Algorithm in Javascript/Algorithms (#939)"}},{"before":"0f107f638d435de126d102dc1843f9e0fb01e31e","after":"560565ae37c1e13572947026ead8bc6aa17ea991","ref":"refs/heads/master","pushedAt":"2023-06-28T02:26:12.632Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Implement counting sort in Python, JavaScript, Java, and C++. Counting sort is a linear time sorting algorithm that works well when the range of values in the input array is small. These implementations all follow the same algorithm, but use different syntax and data structures specific to each language. In each implementation, there is a function that takes an array of integers as input and returns a sorted array of integers. Additionally, there is an example array defined and sorted using the counting sort function, with the sorted result printed to the console or standard output. Added a docstring explaining the algorithm's time and space complexities. This commit completes the implementation of counting sort in four different programming languages. (#935)","shortMessageHtmlLink":"Implement counting sort in Python, JavaScript, Java, and C++. Countin…"}},{"before":"cf72d9b4b220492dcef8a4b410689487b9bf99d2","after":"0f107f638d435de126d102dc1843f9e0fb01e31e","ref":"refs/heads/master","pushedAt":"2023-06-28T02:23:06.084Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Added dijkstras algorithm in C++ (#937)\n\nSigned-off-by: Mayuri Kothari <115354882+MAYURIKOTHARI299@users.noreply.github.com>","shortMessageHtmlLink":"Added dijkstras algorithm in C++ (#937)"}},{"before":"3ff8965cb9dc93152338b9ce5a613feb0c62e710","after":"cf72d9b4b220492dcef8a4b410689487b9bf99d2","ref":"refs/heads/master","pushedAt":"2023-05-30T14:15:29.001Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Added the Shortest Job FIrst Algorithm in Python (#931)\n\nCo-authored-by: Yohannes Teshome <83913756+John-droid-dotcom@users.noreply.github.com>","shortMessageHtmlLink":"Added the Shortest Job FIrst Algorithm in Python (#931)"}},{"before":"5e2086b6e2c6bfd691ce946ef1c0c85eafca1fe9","after":"3ff8965cb9dc93152338b9ce5a613feb0c62e710","ref":"refs/heads/master","pushedAt":"2023-05-30T14:13:51.892Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"codeperfectplus","name":"Deepak Raj","path":"/codeperfectplus","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/54245038?s=80&v=4"},"commit":{"message":"Update MergeSort.py (#927)\n\nRemove the self parameter from both the merge() and mergeSort() functions as they are not instance methods of the class.\r\nRename the arr parameter in the mergeSort() function to unsorted_list or something similar to make it more descriptive.\r\nAdd type hints to the function parameters and return values to improve code readability and maintainability.\r\nUpdate the docstring of the mergeSort() function to adhere to the Python docstring conventions. Note: I assumed that the input list contains only integers. If the list can contain any type of elements, you may need to modify the code accordingly.\r\n\r\nSigned-off-by: NIKITA PANDEY <113332472+nikitapandeyy@users.noreply.github.com>","shortMessageHtmlLink":"Update MergeSort.py (#927)"}},{"before":"041268f4b08786067f58698eb7f8ba675d6805c9","after":"5e2086b6e2c6bfd691ce946ef1c0c85eafca1fe9","ref":"refs/heads/master","pushedAt":"2023-05-29T11:35:39.065Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"Kritika30032002","name":"Kritika Gupta","path":"/Kritika30032002","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/83400697?s=80&v=4"},"commit":{"message":"feat: add counting sort algo (#934)","shortMessageHtmlLink":"feat: add counting sort algo (#934)"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEQxuFOgA","startCursor":null,"endCursor":null}},"title":"Activity · Py-Contributors/AlgorithmsAndDataStructure"}