shadow-prince

import random

def InsertionSort(array):

    for x in range (1, len(array)):
        for i in range(x, 0, -1):
            if array[i] < array[i - 1]:
                t = array[i]
                array[i] = array[i - 1]
                array[i - 1] = t

shadow-prince

/*
 Given  names and phone numbers, assemble a phone book that maps friends' names to their 
 respective phone numbers. You will then be given an unknown number of names to query your
 phone book for. For each  queried, print the associated entry from your phone book on a 
 new line in the form name=phoneNumber; if an entry for  is not found, print Not found instead.
 
 Java
 */
import java.util.*;
import java.io.*;

shadow-prince

import { Mobile } from "./Mobile";

export class BasicPhone extends Mobile{
    mobileType:string;

    constructor(mobileName:string,mobileCost:number,mobileId: number,mobileType:string){
        super(mobileId, mobileName, mobileCost);
        this.mobileType=mobileType;
    }
    

shadow-prince

shadow-prince

shadow-prince