Commit Graph

  • be00df2cd6
    Merge f306f7f50e into 6376bf46af Disha Dinesh Agarwal 2023-10-10 18:26:05 +0000
  • f306f7f50e added a new file named bisection.cpp in the math folder Disha 2023-10-10 23:40:45 +0530
  • e4c123ec5a
    Merge d7bdf07071 into 6376bf46af Brennan Allen 2023-10-09 15:20:18 -0500
  • d7bdf07071
    Merge branch 'master' into master Brennan Allen 2023-10-09 15:20:05 -0500
  • 7728f9533e
    Merge b49b555499 into 6376bf46af KC 2023-10-10 00:38:47 +0530
  • b49b555499
    Update bisection_method.cpp with added documentation KC 2023-10-10 00:38:37 +0530
  • 8445d9f0c1
    Merge 2cdf0c5c30 into 6376bf46af Praful Katare 2023-10-09 18:41:32 +0000
  • 2cdf0c5c30 Fix: Fix function name Kpraful 2023-10-10 00:01:33 +0530
  • e4e002a0b2 feat: add missing_number algorithm, namespace bit_manipulation, function Kpraful 2023-10-10 00:00:37 +0530
  • 592976b0b1 Adds missing number in bit_manipulation Kpraful 2023-10-09 23:50:18 +0530
  • 50c69757fc
    Merge c676e02b4c into 6376bf46af Stressed 2023-10-09 23:04:15 +0800
  • c676e02b4c Fix, Docs, Test: Fibonacci_fast (Renamed to Fibonacci_iterative) Renjian-buchai 2023-10-09 22:47:30 +0800
  • abb307de11
    Merge b2cbd677f6 into 6376bf46af Ankit Kumar Jaipuriar 2023-10-09 13:38:11 +0000
  • b2cbd677f6
    Update 2.2 Tiling Problem.md Ankit Kumar Jaipuriar 2023-10-09 18:59:56 +0530
  • 33be252062
    Update 2.1 X To The Power N.md Ankit Kumar Jaipuriar 2023-10-09 18:59:33 +0530
  • be42e4e5f2
    Update 1.9 Last Occurence Of Element In Array.md Ankit Kumar Jaipuriar 2023-10-09 18:59:15 +0530
  • 93ced94fed
    Update 1.8 First Occurence Of Element In Array.md Ankit Kumar Jaipuriar 2023-10-09 18:58:46 +0530
  • 7f37c0f6c6
    Update 1.7 Check If Array Is Sorted Or Not.md Ankit Kumar Jaipuriar 2023-10-09 18:58:24 +0530
  • fadfffa0a2
    Update 1.6 Print Nth Fibonacci Number.md Ankit Kumar Jaipuriar 2023-10-09 18:58:01 +0530
  • 086e34cbd3
    Update 1.5 Print Sum Of N Natural Number.md Ankit Kumar Jaipuriar 2023-10-09 18:57:19 +0530
  • b526d2af44
    Update 1.3 Factorial of N.md Ankit Kumar Jaipuriar 2023-10-09 18:56:59 +0530
  • 19b54d7997
    Update 1.2 Print numbers in Increasing Order.md Ankit Kumar Jaipuriar 2023-10-09 18:56:41 +0530
  • 270a221346
    Update 1.1 Print numbers in Decreasing Order.md Ankit Kumar Jaipuriar 2023-10-09 18:56:14 +0530
  • 51b328f836 adding recursion folder, please accept it under hacktoberfest Ankit_Jaipuriar 2023-10-09 18:53:56 +0530
  • 89bb754dd7
    Merge 5f77a52043 into 6376bf46af AVINASH KUMAR 2023-10-09 08:17:20 +0000
  • 5f77a52043
    better_input_ll.cpp AVINASH KUMAR 2023-10-09 13:46:36 +0530
  • 0a95c9d362
    better_input_ll.cpp AVINASH KUMAR 2023-10-09 13:16:48 +0530
  • de275e9be7
    Merge 5ae4f90029 into 6376bf46af utkarshbhola 2023-10-09 06:58:41 +0000
  • 5ae4f90029
    Update fibonacci_sum.cpp utkarshbhola 2023-10-09 12:27:55 +0530
  • f3178a2029
    Merge 08da689eff into 6376bf46af Harsh Dev Pathak 2023-10-09 03:53:48 +0000
  • 08da689eff
    Update gray_code.cpp Harsh Dev Pathak 2023-10-09 09:23:45 +0530
  • 45083d8a48
    Merge 9636bd7df6 into 6376bf46af ABHINESH KUMAR JHA 2023-10-08 14:26:12 +0000
  • 9636bd7df6 added binary search AbhineshJha 2023-10-08 19:56:01 +0530
  • 4ca91cdf58
    Merge 9662553854 into 6376bf46af Swayam Patil 2023-10-08 13:32:43 +0000
  • 9662553854 Create silhouette_score.cpp swayam patil 2023-10-08 18:59:34 +0530
  • 281eab9d07
    Merge 0f9be588da into 6376bf46af marishok 2023-10-08 11:18:54 +0000
  • b7081f4103
    Merge 8e54ed8398 into 6376bf46af MANUL 2023-10-08 10:53:46 +0000
  • 8e54ed8398
    Create build_array.cpp MANUL 2023-10-08 16:23:34 +0530
  • 21d3875b48 feat:add graycode algorithm Harsh Dev Pathak 2023-10-08 10:40:23 +0530
  • 1364cd083b
    Merge 921def2e69 into 6376bf46af James Titus 2023-10-06 13:39:53 +0000
  • 921def2e69
    Merge pull request #1 from jamestitus299/main James Titus 2023-10-06 19:06:08 +0530
  • 524ac8bb7d matrix algorithms James Titus 2023-10-06 18:58:59 +0530
  • d0890798d7 Added Implementation of Peak Element Program AbhineshJha 2023-10-06 18:01:08 +0530
  • 13211faf24 Added Program of Find Peak Element in an Array AbhineshJha 2023-10-06 17:59:40 +0530
  • 0f9be588da fix: overflow corrections when finging the middle of a segment marishok 2023-10-06 12:26:14 +0300
  • 3067ba4453
    [ADD] bisection_method.cpp KC 2023-10-06 13:58:43 +0530
  • e210c93487 matrix folder added James Titus 2023-10-06 12:01:27 +0530
  • 28e907d0ce
    Merge a1462cfafb into 6376bf46af Haripriya 2023-10-06 05:18:31 +0000
  • a1462cfafb
    Create kruskals.cpp Haripriya 2023-10-06 10:48:07 +0530
  • 34835a059f
    Merge 5f2706527a into 6376bf46af Haripriya 2023-10-06 05:14:21 +0000
  • 5f2706527a
    Create rankSort.cpp Haripriya 2023-10-06 10:43:47 +0530
  • c74fd2ddb9
    Merge 20f2c97aad into 6376bf46af Haripriya 2023-10-06 05:11:41 +0000
  • 20f2c97aad
    Create nQueens.cpp Haripriya 2023-10-06 10:40:52 +0530
  • 85029bc3e9 DFS(easier approach) khalid 2023-10-06 01:57:21 +0600
  • b896ac8664
    Merge e6be5f5b4b into 6376bf46af Basma Sabry 2023-10-05 09:11:33 +0000
  • e6be5f5b4b
    Create bankers_algorithm.cpp Basma Sabry 2023-10-05 11:56:13 +0300
  • e14b012f11
    Merge c86d9df966 into 6376bf46af Mayank Parkar 2023-10-05 09:17:41 +0530
  • c86d9df966
    Merge branch 'master' into master Mayank Parkar 2023-10-05 09:17:28 +0530
  • 8ee8cfc497
    Merge a1b7bc4fb2 into 6376bf46af Devagya Rattan 2023-10-05 02:03:40 +0000
  • a1b7bc4fb2
    Add files via upload Devagya Rattan 2023-10-05 06:57:39 +0530
  • a21810eb49 heap_sort_added devagya 2023-10-05 06:54:26 +0530
  • 379f8bb229
    Create TARJANS ALGORITHM ABHISHEK 2023-10-04 21:07:17 +0530
  • 30137751d4
    Merge 0c2dbfcc99 into 6376bf46af Ajay Singh Chandel 2023-10-04 06:59:31 +0000
  • 0c2dbfcc99 Add Banker's algorithm implementation in C++. asinghchandel082 2023-10-04 12:09:29 +0530
  • 3de48b1ede
    Merge a3940366e4 into 6376bf46af Jibesh10101011 2023-10-03 10:37:13 +0000
  • 29c5b34873
    Merge bf3183ba79 into 6376bf46af Siddhant Totade 2023-10-03 10:33:53 +0000
  • a3940366e4 Made a radix sort algorithm with step-by-step algorithm steps and code implementation Jibesh Roy 2023-10-03 15:57:53 +0530
  • bf3183ba79 refactor : remove unused LoC SiddhantTotade 2023-10-03 15:39:14 +0530
  • 2dc1f5fdb4 Add Doubly Linked List Implementation SiddhantTotade 2023-10-03 15:33:08 +0530
  • a1fc08edbb
    Merge 5f3f83e8d5 into 6376bf46af Samiksha Mishra 2023-10-03 09:10:47 +0000
  • 5f3f83e8d5
    Create two_sum_problem.cpp Samiksha Mishra 2023-10-03 14:39:12 +0530
  • b376c28091
    Merge 6b0b9c3f1a into 6376bf46af Haripriya 2023-10-03 06:47:41 +0000
  • 6b0b9c3f1a
    Create nQueens.cpp Haripriya 2023-10-03 12:15:38 +0530
  • 2117fa7391
    Merge f0bca0e040 into 6376bf46af Yahya 2023-10-02 17:34:20 +0000
  • f0bca0e040 lagrange method added yahya-mohammed07 2023-10-02 20:33:13 +0300
  • 9408428b86 Add Singly Linked List Implementation SiddhantTotade 2023-10-02 22:10:06 +0530
  • 9eaca15fdf
    Merge 48d179adb5 into 6376bf46af MogomotsiFM 2023-10-02 16:38:57 +0000
  • 48d179adb5 Tests: 1) Add unit tests for SkipList class with a view to refactoring the code, 2) Added a base class for objects that generate uniformly distributed random numbers between 0 and 1. This means we can mock this interface and choose the sequence of "random" numbers. It allows us to choose the level of a key we want to add to the SkipList for testing purposes. Mog 2023-10-02 18:14:47 +0200
  • b7183befce
    Merge f905c60a08 into 6376bf46af Vibhor Agrawal 2023-10-02 16:07:55 +0000
  • f905c60a08 feat: add mosers_circle_problem, class Mosers_circle Vibhor 2023-10-02 21:29:42 +0530
  • f969842877
    Merge 3d6fd518aa into 6376bf46af mahammadhussain98 2023-10-02 13:28:52 +0000
  • 3d6fd518aa
    Merge pull request #1 from mahammadhussain98/mahammadhussain98-patch-1 mahammadhussain98 2023-10-02 18:58:45 +0530
  • d18edd8c04
    added Topological sort mahammadhussain98 2023-10-02 18:58:08 +0530
  • 80636a7e60
    Merge a928ddcccf into 6376bf46af Piotr Idzik 2023-10-02 13:51:15 +0200
  • a928ddcccf style: initialize NCRModuloP::p with 0 Piotr Idzik 2023-07-20 09:22:28 +0200
  • 0c19cdfdb0 feat: display message when all tests pass Piotr Idzik 2023-06-23 23:25:01 +0200
  • e147656106 dosc: add missing docs piotr.idzik 2023-06-21 23:40:52 +0200
  • daa561e1f1 Apply suggestions from code review Piotr Idzik 2023-05-30 07:54:24 +0200
  • 7c8dd50c33 docs: udpate doc-strs and add example() piotr.idzik 2023-05-25 22:33:36 +0200
  • ad67b425ac docs: remove p from docstr of NCRModuloP::ncr Piotr Idzik 2023-05-21 17:15:33 +0200
  • d6abff8c2c docs: update explanation why to import iostream piotr.idzik 2023-05-20 11:14:43 +0200
  • 9982285822 style: use int64_t to avoid narrowing conversions piotr.idzik 2023-05-20 11:02:06 +0200
  • a44a96af68 style: use auto piotr.idzik 2023-05-19 23:08:54 +0200
  • de939dd5f2 style: make example object const piotr.idzik 2023-05-19 23:05:37 +0200
  • f687626ab1 refactor: simplify logic piotr.idzik 2023-05-19 23:04:59 +0200
  • 9a3a325ec0 test: add missing test cases piotr.idzik 2023-05-19 22:49:56 +0200
  • 6b33bd9597 test: reorganize tests piotr.idzik 2023-05-19 22:42:54 +0200
  • 8f13267231 style: make NCRModuloP::ncr const piotr.idzik 2023-05-19 22:34:06 +0200
  • 5a7b3505e3 refactor: add NCRModuloP::computeFactorialsMod piotr.idzik 2023-05-19 22:33:04 +0200
  • a0a6670ef2 refactor: use references in gcdExtended piotr.idzik 2023-05-19 22:23:26 +0200