# Author Archives: victor

## 5 easy steps to improve your skills as a Software Developer!

How do I write code that allows me to deliver a project on time, is optimal, and easy to maintain? How do I become a better programmer? This is the checklist that has allowed me to work with various programming … Continue reading

## Insertion sort php

<?php /** * An unsorted list of integers * Worst case O(n^2) * Best case O(n) * @param array $unsorted */ function insertionSort(array &$unsorted){ for($i = 1; $i < count($unsorted); $i++){ $temp = $unsorted[$i]; $j = $i – 1; while … Continue reading

## Calculate the diagonal difference of an N x N matrix

<?php /** * Calculate the diagonal difference of an N x N matrix * * runs in O(n) * * @param int $n size of N x N array * @param array $a N x N array * * @return … Continue reading

## EBOX (formerly Electronic Box) Internet Service – A review

I am writing this to help out Canadian internet users that might be on, or thinking of signing up Electronic Box/EBOX. Do it – switch. EBOX is an independent Internet Service Provider (ISP) that piggybacks on the network infrastructure of Bell, Rogers, Videotron, or Cogeco. … Continue reading

## Finding your local African Business in Montreal / Toronto / Calgary – Try Afroll.com

Finding local ethnic establishment is not an easy task. What do I google to find an African business closest to me? Who do I ask? What are the first steps? Non of these are easy answers. You find that most … Continue reading

## The Book Of Not by Tsitsi Dangarembwa – a review

I bought The Book Of Not in 2010. I waited 3 years to read it. The first time I opened the book, I felt overwhelmed with anticipation. I was not sure that if I read the book in between my … Continue reading

## Double Ended Queue implementation in Java, and Operations run in O(1) time

public class Main { /** * @param args */ public static void main(String[] args) { Deque<Integer> Q = new Deque<Integer>(6); try { Q.addFirst(3); System.out.println(Q); Q.addFirst(5); System.out.println(Q); … Continue reading

## Resursion to add n by n elements in an array

Algorithm Algorithm sum(A,n) Input: A, an n by n array Output: The sum of elements in A if n=1 then return A[0][0] s ← 0 while i < n -1 do s ← s + A[i][n-1] … Continue reading

## power function in O(n) time, algorithm plus implementation in python

Algorithm number 1. Algorithm powerOf(x,n) Input: integer n, non negative integer x Output : x to the power of n if n = 0 return 1 m ← 0 while n > 0 … Continue reading

## Nonrecursive Factorial Algorithm and Implementation in python

Algorithm fact(n) input: Nonegative integer n output: Fibonacci value of n if n = 0 return 1 m ← 1 k ← 1 while n ≥ k do m ← … Continue reading