juicylulu Goto Github PK

array-rotation

Rotate an array to the right by a given number of steps.

cs61a-1.7--integer-partition-without-recursion

The number of partitions of a positive integer n, using parts up to size m, is the number of ways in which n can be expressed as the sum of positive integer parts up to m in increasing order. For example, the number of partitions of 6 using parts up to 4 is 9. 6 = 2 + 4 6 = 1 + 1 + 4 6 = 3 + 3 6 = 1 + 2 + 3 6 = 1 + 1 + 1 + 3 6 = 2 + 2 + 2 6 = 1 + 1 + 2 + 2 6 = 1 + 1 + 1 + 1 + 2 6 = 1 + 1 + 1 + 1 + 1 + 1 We will define a function count_partitions(n, m) that returns the number of different partitions of n using parts up to m.

euler-78

An integer partitioning problem solved using recursion

integer-partition

integerpartition

The code that can calculate the amount of possible partitions of an integers.

java_arrayleftrotation

Rotates the members of an array by a number smaller or equal to the size of the array.

parallel-merge-sort-with-mpi

partition_generator

Generates all the partitions of a positive integer

rotateanarray

Java program to rotate an array given number of times and print it - O(rotations * arrayLength)

spiralarray

A method that converts a two-dimensional array to a one-dimensional array in a clockwise direction.

spiralarray-1

spiralarray-2

Print to console the given matrix in a spiral form

spiralarrayprogram

This program will take a N x M array and create a spiral from the top left corner to the right and spiral inwards.

teeofen

Calculates for the running time of code.