Skip to content
View pooyahatami's full-sized avatar

Block or report pooyahatami

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Popular repositories Loading

  1. Algorithm-Sort-Bead Algorithm-Sort-Bead Public

    Also known as Gravity sort, this algorithm was inspired from natural phenomenons and was designed keeping in mind objects(or beads) falling under the influence of gravity.

    JavaScript 3 1

  2. Algorithm-Sort-Radix Algorithm-Sort-Radix Public

    In computer science, radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position …

    JavaScript 2 2

  3. Algorithm-Sort-Bucket Algorithm-Sort-Bucket Public

    Bucket sort is mainly useful when input is uniformly distributed over a range. For example, consider the following problem.

    JavaScript 2

  4. Algorithm-Sort-Insertion Algorithm-Sort-Insertion Public

    Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.

    JavaScript 1 1

  5. Algorithm-Sort-Counting Algorithm-Sort-Counting Public

    Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to c…

    JavaScript 1

  6. Algorithm-Sort-Merge Algorithm-Sort-Merge Public

    Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves.

    JavaScript 1