Krishna Vedala kvedala

## fibonacci_fast.c
/**
    @file Fibonacci_fast.c
    @author: Krishna Vedala
    @date 2 October, 2019
    @brief Compute \f$m^{mth}\f$ Fibonacci number using the formulae:
    \f{eqnarray*}{
        F_{2n-1} &=& F_n^2 + F_{n-1}^2 \\
        F_{2n}   &=& F_n\left(2F_{n-1} + F_n\right)
   \f}
*/

## Weight tracking.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kvedala
                / Weight tracking.ipynb
            
            
              Created
              March 1, 2020 15:08
            
              
                Weight tracking.ipynb
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## complex exponentials.py
import numpy as np
from matplotlib import pyplot as plt
from mpl_toolkits.axes_grid.axislines import SubplotZero
from matplotlib.transforms import BlendedGenericTransform
plt.rcParams['svg.fonttype'] = 'none'

A = complex(.5,.75)
pows = [0]*11
real = [0]*11
imag = [0]*11

## Project Euler - Problem 16, 20 - Power digit sum & Factorial digit sum.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kvedala
                / Project Euler - Problem 16, 20 - Power digit sum & Factorial digit sum.ipynb
            
            
              Last active
              March 10, 2020 23:47
            
              
                removed cython annotations
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## Project Euler - Problem 14 - Longest Collatz Sequence.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kvedala
                / Project Euler - Problem 14 - Longest Collatz Sequence.ipynb
            
            
              Last active
              March 11, 2020 00:28
            
              
                Project Euler - Problem 14 - Longest Collatz Sequence.ipynb
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## factorial.c

/**
 * Factorial algorithm -
 *  Divide, Swing & Conquer from https://oeis.org/A000142/a000142.pdf
 **/


/**
 * check if input number is prime.
 * Return 1 if prime, otherwise 0

## -sorting-algorithms-quick-sort-and-shell-sort.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kvedala
                / -sorting-algorithms-quick-sort-and-shell-sort.ipynb
            
            
              Created
              April 29, 2020 02:42
            
              
                 Sorting algorithms - Quick sort and Shell sort
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## fast polynomial roots.ipynb

      
              2 files
            
          
              0 forks
            
          
              1 comment
            
          
              0 stars
            
          
                kvedala
                / fast polynomial roots.ipynb
            
            
              Last active
              April 29, 2020 03:02
            
              
                Durand-Kerner Roots - Python
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## Madelbrot optimization.ipynb

      
              2 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kvedala
                / Madelbrot optimization.ipynb
            
            
              Last active
              April 29, 2020 03:13
            
              
                Mandelbrot optimization
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## notebook.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                kvedala
                / notebook.ipynb
            
            
              Last active
              May 15, 2020 00:51
            
              
                Hill Cypher - Python and Cython
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
	/**
	@file Fibonacci_fast.c
	@author: Krishna Vedala
	@date 2 October, 2019
	@brief Compute \f$m^{mth}\f$ Fibonacci number using the formulae:
	\f{eqnarray*}{
	F_{2n-1} &=& F_n^2 + F_{n-1}^2 \\
	F_{2n} &=& F_n\left(2F_{n-1} + F_n\right)
	\f}
	*/
	import numpy as np
	from matplotlib import pyplot as plt
	from mpl_toolkits.axes_grid.axislines import SubplotZero
	from matplotlib.transforms import BlendedGenericTransform
	plt.rcParams['svg.fonttype'] = 'none'

	A = complex(.5,.75)
	pows = [0]*11
	real = [0]*11
	imag = [0]*11

	/**
	* Factorial algorithm -
	* Divide, Swing & Conquer from https://oeis.org/A000142/a000142.pdf
	**/


	/**
	* check if input number is prime.
	* Return 1 if prime, otherwise 0