Kwisses

"""Multiply two matrices using helper functions; outputs resulting matrix."""


def get_row(matrix, row):
    return matrix[row]


def get_column(matrix, column_number):
    column = []

Kwisses

package insertionsort;

class IS7 {
	
	private static void printArray(int[] array) {
		
		for(int i: array) {
			System.out.print(i + " ");
		}
		

Kwisses

package selectionsort;

class SS7 {
	
	private static void printArray(int[] array) {
		
		for(int i: array) {
			System.out.print(i + " ");
		}
		

Kwisses

def merge_sort(array):

    if len(array) <= 1:
        return array

    midpoint = int(len(array) / 2)

    left, right = merge_sort(array[:midpoint]), merge_sort(array[midpoint:])

    return merge(left, right)

Kwisses

package mergesort;

class MergeSortTutorial {
	
	// Helper method to print out the integer array.
	private static void printArray(int[] array) {
		
		for(int i: array) {
			System.out.print(i + " ");
		}

Kwisses

class MergeSort:

    def merge_sort(self, array):

        if len(array) <= 1:
            return array

        midpoint = int(len(array) / 2)

        left = []

Kwisses

package swingapplications;

import java.awt.*;
import java.awt.event.*;
import javax.swing.*;

// A visual metronome that displays 4/4 time count.
class VisualMetronome implements ActionListener, Runnable {
	Thread t;
	

Kwisses

class StringPermutation:

    def __init__(self):
        self.dict = {}
        self.chars = []
        self.count = []
        self.result = []

    def run(self, string):
        for char in string:

Kwisses

package stringpermutations;

import java.util.Map;
import java.util.TreeMap;

class StringPermutation {
	
	private static char[] array;
	private static char[] chars;
	private static int[] count;

Kwisses

package quicksort;

class QuickSortDemo {

	public static void main(String args[]) {
		
		int[] intArray = { 21, 38, 52, 19, 30, 53, 19, 55, 16, 21 };
		QuickSort qs = new QuickSort(intArray);
		
		qs.run(0, 9);