Each team works on assigned sorting algorithms and will give demonstration and PowerPoint
presentation on Nov. 16^th during lab class. Search internet for tutorials and source code in
python on sorting algorithms assigned to your team. Modify the python code to count the number
of comparisons and the number of swaps when sorting a random list of size n, n>=100, for
example, n = 100, 1000, 10000. To test your program use a small size of n for example, n = 10,
and print the list before and after sorting. Once confirmed the your program sorts correctly, try
larger size of n without print the list. In your presentation, explain how do the sorting algorithms
work and given their worst case and average case complexity, and include following table:
Submit the source code and presentation to D2L Assignment for Team Project 1 before
11:00PM. 11/16/2016 Sorting Algorithms: Selection sort, quick sort Insertion sort, shell sort
Bubble sort, merge sort Heap sort Radix sort
Solution
Selection Sort:
def selectionSort(list1):
for x in range(len(list1)-1,0,-1):
max_pos=0
for location in range(1,x+1):
if list1[location]>list1[max_pos]:
max_pos = location
temp = list1[x]
list1[x] = list1[max_pos]
list1[max_pos] = temp
list1 = [100,550,12,10,9]
selectionSort(list1)
print \"Sorted List\"
print(list1)
================================================
Output:
Sorted List
[9, 10, 12, 100, 550]
==================================================
Quck sort
def quickSort(list1):
quickSortHelper(list1,0,len(list1)-1)
def quickSortHelper(list1,left,right):
if left= pivot and r >= l:
r = r -1
if r < l:
done = True
else:
temp = list1[l]
list1[l] = list1[r]
list1[r] = temp
temp = list1[left]
list1[left] = list1[r]
list1[r] = temp
return r
list1 = [100,550,12,10,9]
quickSort(list1)
print(list1)
=============================================
Output:
[9, 10, 12, 100, 550]
=================================================
insertion sort:
def insertionSort(list1):
for i in range(1,len(list1)):
currentvalue = list1[i]
position = i
while position>0 and list1[position-1]>currentvalue:
list1[position]=list1[position-1]
position = position-1
list1[position]=currentvalue
list1 = [100,550,12,10,9]
insertionSort(list1)
print(list1)
===================================================
Output:
[9, 10, 12, 100, 550]
=================================================
Bubble sort:
def bubbleSort(list1):
for x in range(len(list1)-1,0,-1):
for i in range(x):
if list1[i]>list1[i+1]:
temp = list1[i]
list1[i] = list1[i+1]
list1[i+1] = temp
list1 = [100,550,12,10,9]
bubbleSort(list1)
print(list1)
======================================
Output:
[9, 10, 12, 100, 550]
====================================
def mergeSort(list1):
print(\"Splitting list \",list1)
if len(list1)>1:
mid = len(list1)//2
lefthalf = list1[:mid]
righthalf = list1[mid:]
mergeSort(lefthalf)
mergeSort(righthalf)
i=0
j=0
k=0
while i < len(lefthalf) and j < len(righthalf):
if lefthalf[i] < righthalf[j]:
list1[k]=lefthalf[i]
i=i+1
else:
lis.
Implement the following sorting algorithms Bubble Sort Insertion S.pdfkesav24
Implement the following sorting algorithms: Bubble Sort Insertion Sort. Selection Sort.
Merge Sort. Heap Sort. Quick Sort. For each of the above algorithms, measure the execution
time based on input sizes n, n + 10(i), n + 20(i), n + 30(i), .. ., n + 100(i) for n = 50000 and i =
100. Let the array to be sorted be randomly initialized. Use the same machine to measure all the
algorithms. Plot a graph to compare the execution times you collected in part(2).
Solution
This code wil create a graph for each plots comparing time for different sorting methods and also
save those plots in the current directory.
from random import shuffle
from time import time
import numpy as np
import matplotlib.pyplot as plt
def bubblesort(arr):
for i in range(len(arr)):
for k in range(len(arr)-1, i, -1):
if (arr[k] < arr[k-1]):
tmp = arr[k]
arr[k] = arr[k-1]
arr[k-1] = tmp
return arr
def selectionsort(arr):
for fillslot in range(len(arr)-1,0,-1):
positionOfMax=0
for location in range(1,fillslot+1):
if arr[location]>arr[positionOfMax]:
positionOfMax = location
temp = arr[fillslot]
arr[fillslot] = arr[positionOfMax]
arr[positionOfMax] = temp
return arr
def insertionsort(arr):
for i in range( 1, len( arr ) ):
tmp = arr[i]
k = i
while k > 0 and tmp < arr[k - 1]:
arr[k] = arr[k-1]
k -= 1
arr[k] = tmp
return arr
# def mergesort(arr):
#
# if len(arr)>1:
# mid = len(arr)//2
# lefthalf = arr[:mid]
# righthalf = arr[mid:]
#
# mergesort(lefthalf)
# mergesort(righthalf)
#
# i=0
# j=0
# k=0
# while i < len(lefthalf) and j < len(righthalf):
# if lefthalf[i] < righthalf[j]:
# arr[k]=lefthalf[i]
# i=i+1
# else:
# arr[k]=righthalf[j]
# j=j+1
# k=k+1
#
# while i < len(lefthalf):
# arr[k]=lefthalf[i]
# i=i+1
# k=k+1
#
# while j < len(righthalf):
# arr[k]=righthalf[j]
# j=j+1
# k=k+1
#
# return arr
def mergesort(x):
result = []
if len(x) < 2:
return x
mid = int(len(x)/2)
y = mergesort(x[:mid])
z = mergesort(x[mid:])
i = 0
j = 0
while i < len(y) and j < len(z):
if y[i] > z[j]:
result.append(z[j])
j += 1
else:
result.append(y[i])
i += 1
result += y[i:]
result += z[j:]
return result
def quicksort(arr):
less = []
equal = []
greater = []
if len(arr) > 1:
pivot = arr[0]
for x in arr:
if x < pivot:
less.append(x)
if x == pivot:
equal.append(x)
if x > pivot:
greater.append(x)
return quicksort(less)+equal+quicksort(greater) # Just use the + operator to join lists
else:
return arr
#### Heap sort
def heapsort(arr): #convert arr to heap
length = len(arr) - 1
leastParent = length / 2
for i in range(leastParent, -1, -1):
moveDown(arr, i, length)
# flatten heap into sorted array
for i in range(length, 0, -1):
if arr[0] > arr[i]:
swap(arr, 0, i)
moveDown(arr, 0, i - 1)
def moveDown(arr, first, last):
largest = 2 * first + 1
while largest <= last: #right child exists and is larger than left child
if (largest < last) and(arr[largest] < arr[largest + 1]):
largest += 1
# right child is larger than parent
if arr[largest] > arr[first]:
swap(arr, largest, first)# move down to largest child
first = largest
lar.
This presentation takes you on a functional programming journey, it starts from basic Scala programming language design concepts and leads to a concept of Monads, how some of them designed in Scala and what is the purpose of them
Implement the following sorting algorithms Bubble Sort Insertion S.pdfkesav24
Implement the following sorting algorithms: Bubble Sort Insertion Sort. Selection Sort.
Merge Sort. Heap Sort. Quick Sort. For each of the above algorithms, measure the execution
time based on input sizes n, n + 10(i), n + 20(i), n + 30(i), .. ., n + 100(i) for n = 50000 and i =
100. Let the array to be sorted be randomly initialized. Use the same machine to measure all the
algorithms. Plot a graph to compare the execution times you collected in part(2).
Solution
This code wil create a graph for each plots comparing time for different sorting methods and also
save those plots in the current directory.
from random import shuffle
from time import time
import numpy as np
import matplotlib.pyplot as plt
def bubblesort(arr):
for i in range(len(arr)):
for k in range(len(arr)-1, i, -1):
if (arr[k] < arr[k-1]):
tmp = arr[k]
arr[k] = arr[k-1]
arr[k-1] = tmp
return arr
def selectionsort(arr):
for fillslot in range(len(arr)-1,0,-1):
positionOfMax=0
for location in range(1,fillslot+1):
if arr[location]>arr[positionOfMax]:
positionOfMax = location
temp = arr[fillslot]
arr[fillslot] = arr[positionOfMax]
arr[positionOfMax] = temp
return arr
def insertionsort(arr):
for i in range( 1, len( arr ) ):
tmp = arr[i]
k = i
while k > 0 and tmp < arr[k - 1]:
arr[k] = arr[k-1]
k -= 1
arr[k] = tmp
return arr
# def mergesort(arr):
#
# if len(arr)>1:
# mid = len(arr)//2
# lefthalf = arr[:mid]
# righthalf = arr[mid:]
#
# mergesort(lefthalf)
# mergesort(righthalf)
#
# i=0
# j=0
# k=0
# while i < len(lefthalf) and j < len(righthalf):
# if lefthalf[i] < righthalf[j]:
# arr[k]=lefthalf[i]
# i=i+1
# else:
# arr[k]=righthalf[j]
# j=j+1
# k=k+1
#
# while i < len(lefthalf):
# arr[k]=lefthalf[i]
# i=i+1
# k=k+1
#
# while j < len(righthalf):
# arr[k]=righthalf[j]
# j=j+1
# k=k+1
#
# return arr
def mergesort(x):
result = []
if len(x) < 2:
return x
mid = int(len(x)/2)
y = mergesort(x[:mid])
z = mergesort(x[mid:])
i = 0
j = 0
while i < len(y) and j < len(z):
if y[i] > z[j]:
result.append(z[j])
j += 1
else:
result.append(y[i])
i += 1
result += y[i:]
result += z[j:]
return result
def quicksort(arr):
less = []
equal = []
greater = []
if len(arr) > 1:
pivot = arr[0]
for x in arr:
if x < pivot:
less.append(x)
if x == pivot:
equal.append(x)
if x > pivot:
greater.append(x)
return quicksort(less)+equal+quicksort(greater) # Just use the + operator to join lists
else:
return arr
#### Heap sort
def heapsort(arr): #convert arr to heap
length = len(arr) - 1
leastParent = length / 2
for i in range(leastParent, -1, -1):
moveDown(arr, i, length)
# flatten heap into sorted array
for i in range(length, 0, -1):
if arr[0] > arr[i]:
swap(arr, 0, i)
moveDown(arr, 0, i - 1)
def moveDown(arr, first, last):
largest = 2 * first + 1
while largest <= last: #right child exists and is larger than left child
if (largest < last) and(arr[largest] < arr[largest + 1]):
largest += 1
# right child is larger than parent
if arr[largest] > arr[first]:
swap(arr, largest, first)# move down to largest child
first = largest
lar.
This presentation takes you on a functional programming journey, it starts from basic Scala programming language design concepts and leads to a concept of Monads, how some of them designed in Scala and what is the purpose of them
Ejercicios de estilo en la programaciónSoftware Guru
El escritor francés Raymond Queneau escribió a mediados del siglo XX un libro llamado "Ejercicios de Estilo" donde mostraba una misma historia corta, redactada de 99 formas distintas.
En esta plática realizaremos el mismo ejercicio con un programa de software. Abarcaremos distintos estilos y paradigmas: programación monolítica, orientada a objetos, relacional, orientada a aspectos, monadas, map-reduce, y muchos otros, a través de los cuales podremos apreciar la riqueza del pensamiento humano aplicado a la computación.
Esto va mucho más allá de un ejercicio académico; el diseño de sistemas de gran escala se alimenta de esta variedad de estilos. También platicaremos sobre los peligros de quedar atrapado bajo un conjunto reducido de estilos a lo largo de tu carrera, y la necesidad de verdaderamente entender distintos estilos al diseñar arquitecturas de sistemas de software.
Semblanza del conferencista:
Crista Lopez es profesora en la Facultad de Ciencias Computacionales de la Universidad de California en Irvine. Su investigación se enfoca en prácticas de ingeniería de software para sistemas de gran escala. Previamente, fue miembro fundador del equipo en Xerox PARC creador del paradigma de programación orientado a aspectos (AOP). Crista es una de las desarrolladoras principales de OpenSimulator, una plataforma open source para crear mundos virtuales 3D. También es fundadora de Encitra, empresa especializada en la utilización de la realidad virtual para proyectos de desarrollo urbano sustentable. @cristalopes
Is it easier to add functional programming features to a query language, or to add query capabilities to a functional language? In Morel, we have done the latter.
Functional and query languages have much in common, and yet much to learn from each other. Functional languages have a rich type system that includes polymorphism and functions-as-values and Turing-complete expressiveness; query languages have optimization techniques that can make programs several orders of magnitude faster, and runtimes that can use thousands of nodes to execute queries over terabytes of data.
Morel is an implementation of Standard ML on the JVM, with language extensions to allow relational expressions. Its compiler can translate programs to relational algebra and, via Apache Calcite’s query optimizer, run those programs on relational backends.
In this talk, we describe the principles that drove Morel’s design, the problems that we had to solve in order to implement a hybrid functional/relational language, and how Morel can be applied to implement data-intensive systems.
(A talk given by Julian Hyde at Strange Loop 2021, St. Louis, MO, on October 1st, 2021.)
Morel, a data-parallel programming languageJulian Hyde
What would the perfect data-parallel programming language look like? It would be as expressive as a general-purpose functional programming language, as powerful and concise as SQL, and run programs just as efficiently on a laptop or a thousand-node cluster.
We present Morel, a functional programming language with relational extensions, working towards that goal. Morel is implemented in the Apache Calcite community on top of Calcite’s relational algebra framework. In this talk, we describe Morel’s evolution, including how we are pushing Calcite’s capabilities with graph and recursive queries.
A talk given by Julian Hyde at ApacheCon, New Orleans, October 4th 2022.
Nat, List and Option Monoids - from scratch - Combining and Folding - an examplePhilip Schwarz
Nat, List and Option Monoids, from scratch. Combining and Folding: an example.
This is a new version of the original which has some cosmetic changes and a new 7th slide which only differs from slide 6 in that it defines the fold function in terms of the foldRight function.
Code: https://github.com/philipschwarz/nat-list-and-option-monoids-from-scratch-combining-and-folding-an-example
Presented at 8th Light University London (13th May 2016)
Do this, do that. Coding from assembler to shell scripting, from the mainstream languages of the last century to the mainstream languages now, is dominated by an imperative style. From how we teach variables — they vary, right? — to how we talk about databases, we are constantly looking at state as a thing to be changed and programming languages are structured in terms of the mechanics of change — assignment, loops and how code can be threaded (cautiously) with concurrency.
Functional programming, mark-up languages, schemas, persistent data structures and more are all based around a more declarative approach to code, where instead of reasoning in terms of who does what to whom and what the consequences are, relationships and uses are described, and the flow of execution follows from how functions, data and other structures are composed. This talk will look at the differences between imperative and declarative approaches, offering lessons, habits and techniques that are applicable from requirements through to code and tests in mainstream languages.
CenTable - Requirements Specification CenTable is a system for creati.pdfomarionmatzmcwill497
CenTable - Requirements Specification CenTable is a system for creating tabular reports from
county-level U.S.Census Data it is appropriate for batch processing (both off Ine and in support
of an on-line system). The inputs to the system are the ASCII county data fle (land associated
data dictionary) and an ASCI tle that describes the tabular report to be created. The output is a
table in either HTMI or AScll text format 1. Command-Line Parameters 1.1. The first command
line parameter must be the mame of the county level data file to use. 1.2 The second parameter
must be either-h (to indicate that the output should be in HTMor (to indicate that the output
should be in ASCl et) Location of \"Files\" .1. All census data fles must be in the same directory
as the executable 2.2 The report desoription fle must be read from standard in. 2· 3 Report
Description File 1. The format of the report deicription file has not been specified 32. Contents
of the Report Description File 3.2.1it must include a list of all of the counbies to include in the
report 22.It musz contain the field identifiers for the columns so inclade in the report [in ender.
3.23Jt mast contain #tte for each field in the report. 3.2.3.1 It must contain a format descriptor for
the title that idudt the horizonal positioning of the titie (left, center, or right) and the appropriane
way to handle ttles that are too long truncate, break word boundareia 324Jt must contain a format
descrigtor for each field in the report that includes the width of the field, the number of digts to
the right of the decimal place (for floating-point fields the padding character to use, and an
indication of whether or not the sign should always 12 5Jt must contain a specifier for each field
Chatt indicates what information (total, mean nothingl should be diplayed in the last now of the
output 1 42 Output must When the containing the required information 42.1. The tedt must be
displayed in a xed-width font 4.22. The output need not handle page breaks ie, the repert can
have an arbitrary mumber of be sent to standard out witch is used, the output must be an
appropriately formatted HTML table rows when the fiag t.ned, the output munt be an
approprately formatted ASCII tnt file ethat wil look coreect when displayed in a feed with fo
4.3.1 The output need not handle page breaks e, the report can have an arbibrary number of rows.
S1 The report desoription fle may be generated by an untrusted source. 52 Command-line
parameters may be provided by an untrusted source 5.3. CenTable must only be able to read 0m
the dinectory is installed in and standard in, Centable must only be able to write to standa out.
Solution
Okay So basically what you have to create a C Program for an application. This should be called
CenTable.
Input:
1. This system will take as input a text file which contains information about countries and their
census. It must be containing a lot of fields. You need to once take a look at the file to
unders.
Are silenced genes associated with high or low levels of DNA methyla.pdfomarionmatzmcwill497
Are silenced genes associated with high or low levels of DNA methylation?
Solution
1.Genes are silenced by methylation(adding methyl groups). Gene silencing is the process of
turning off genes,so that it will not produce proteins through translation process.
2. Gene silencing is done by adding methyl groups to the genes. So that gene is inactive.
So we conclude that silenced genes associated with high methylation. Because when gene is
methylated only then silencing of gene occurs..
More Related Content
Similar to Each team works on assigned sorting algorithms and will give demonstr.pdf
Ejercicios de estilo en la programaciónSoftware Guru
El escritor francés Raymond Queneau escribió a mediados del siglo XX un libro llamado "Ejercicios de Estilo" donde mostraba una misma historia corta, redactada de 99 formas distintas.
En esta plática realizaremos el mismo ejercicio con un programa de software. Abarcaremos distintos estilos y paradigmas: programación monolítica, orientada a objetos, relacional, orientada a aspectos, monadas, map-reduce, y muchos otros, a través de los cuales podremos apreciar la riqueza del pensamiento humano aplicado a la computación.
Esto va mucho más allá de un ejercicio académico; el diseño de sistemas de gran escala se alimenta de esta variedad de estilos. También platicaremos sobre los peligros de quedar atrapado bajo un conjunto reducido de estilos a lo largo de tu carrera, y la necesidad de verdaderamente entender distintos estilos al diseñar arquitecturas de sistemas de software.
Semblanza del conferencista:
Crista Lopez es profesora en la Facultad de Ciencias Computacionales de la Universidad de California en Irvine. Su investigación se enfoca en prácticas de ingeniería de software para sistemas de gran escala. Previamente, fue miembro fundador del equipo en Xerox PARC creador del paradigma de programación orientado a aspectos (AOP). Crista es una de las desarrolladoras principales de OpenSimulator, una plataforma open source para crear mundos virtuales 3D. También es fundadora de Encitra, empresa especializada en la utilización de la realidad virtual para proyectos de desarrollo urbano sustentable. @cristalopes
Is it easier to add functional programming features to a query language, or to add query capabilities to a functional language? In Morel, we have done the latter.
Functional and query languages have much in common, and yet much to learn from each other. Functional languages have a rich type system that includes polymorphism and functions-as-values and Turing-complete expressiveness; query languages have optimization techniques that can make programs several orders of magnitude faster, and runtimes that can use thousands of nodes to execute queries over terabytes of data.
Morel is an implementation of Standard ML on the JVM, with language extensions to allow relational expressions. Its compiler can translate programs to relational algebra and, via Apache Calcite’s query optimizer, run those programs on relational backends.
In this talk, we describe the principles that drove Morel’s design, the problems that we had to solve in order to implement a hybrid functional/relational language, and how Morel can be applied to implement data-intensive systems.
(A talk given by Julian Hyde at Strange Loop 2021, St. Louis, MO, on October 1st, 2021.)
Morel, a data-parallel programming languageJulian Hyde
What would the perfect data-parallel programming language look like? It would be as expressive as a general-purpose functional programming language, as powerful and concise as SQL, and run programs just as efficiently on a laptop or a thousand-node cluster.
We present Morel, a functional programming language with relational extensions, working towards that goal. Morel is implemented in the Apache Calcite community on top of Calcite’s relational algebra framework. In this talk, we describe Morel’s evolution, including how we are pushing Calcite’s capabilities with graph and recursive queries.
A talk given by Julian Hyde at ApacheCon, New Orleans, October 4th 2022.
Nat, List and Option Monoids - from scratch - Combining and Folding - an examplePhilip Schwarz
Nat, List and Option Monoids, from scratch. Combining and Folding: an example.
This is a new version of the original which has some cosmetic changes and a new 7th slide which only differs from slide 6 in that it defines the fold function in terms of the foldRight function.
Code: https://github.com/philipschwarz/nat-list-and-option-monoids-from-scratch-combining-and-folding-an-example
Presented at 8th Light University London (13th May 2016)
Do this, do that. Coding from assembler to shell scripting, from the mainstream languages of the last century to the mainstream languages now, is dominated by an imperative style. From how we teach variables — they vary, right? — to how we talk about databases, we are constantly looking at state as a thing to be changed and programming languages are structured in terms of the mechanics of change — assignment, loops and how code can be threaded (cautiously) with concurrency.
Functional programming, mark-up languages, schemas, persistent data structures and more are all based around a more declarative approach to code, where instead of reasoning in terms of who does what to whom and what the consequences are, relationships and uses are described, and the flow of execution follows from how functions, data and other structures are composed. This talk will look at the differences between imperative and declarative approaches, offering lessons, habits and techniques that are applicable from requirements through to code and tests in mainstream languages.
CenTable - Requirements Specification CenTable is a system for creati.pdfomarionmatzmcwill497
CenTable - Requirements Specification CenTable is a system for creating tabular reports from
county-level U.S.Census Data it is appropriate for batch processing (both off Ine and in support
of an on-line system). The inputs to the system are the ASCII county data fle (land associated
data dictionary) and an ASCI tle that describes the tabular report to be created. The output is a
table in either HTMI or AScll text format 1. Command-Line Parameters 1.1. The first command
line parameter must be the mame of the county level data file to use. 1.2 The second parameter
must be either-h (to indicate that the output should be in HTMor (to indicate that the output
should be in ASCl et) Location of \"Files\" .1. All census data fles must be in the same directory
as the executable 2.2 The report desoription fle must be read from standard in. 2· 3 Report
Description File 1. The format of the report deicription file has not been specified 32. Contents
of the Report Description File 3.2.1it must include a list of all of the counbies to include in the
report 22.It musz contain the field identifiers for the columns so inclade in the report [in ender.
3.23Jt mast contain #tte for each field in the report. 3.2.3.1 It must contain a format descriptor for
the title that idudt the horizonal positioning of the titie (left, center, or right) and the appropriane
way to handle ttles that are too long truncate, break word boundareia 324Jt must contain a format
descrigtor for each field in the report that includes the width of the field, the number of digts to
the right of the decimal place (for floating-point fields the padding character to use, and an
indication of whether or not the sign should always 12 5Jt must contain a specifier for each field
Chatt indicates what information (total, mean nothingl should be diplayed in the last now of the
output 1 42 Output must When the containing the required information 42.1. The tedt must be
displayed in a xed-width font 4.22. The output need not handle page breaks ie, the repert can
have an arbitrary mumber of be sent to standard out witch is used, the output must be an
appropriately formatted HTML table rows when the fiag t.ned, the output munt be an
approprately formatted ASCII tnt file ethat wil look coreect when displayed in a feed with fo
4.3.1 The output need not handle page breaks e, the report can have an arbibrary number of rows.
S1 The report desoription fle may be generated by an untrusted source. 52 Command-line
parameters may be provided by an untrusted source 5.3. CenTable must only be able to read 0m
the dinectory is installed in and standard in, Centable must only be able to write to standa out.
Solution
Okay So basically what you have to create a C Program for an application. This should be called
CenTable.
Input:
1. This system will take as input a text file which contains information about countries and their
census. It must be containing a lot of fields. You need to once take a look at the file to
unders.
Are silenced genes associated with high or low levels of DNA methyla.pdfomarionmatzmcwill497
Are silenced genes associated with high or low levels of DNA methylation?
Solution
1.Genes are silenced by methylation(adding methyl groups). Gene silencing is the process of
turning off genes,so that it will not produce proteins through translation process.
2. Gene silencing is done by adding methyl groups to the genes. So that gene is inactive.
So we conclude that silenced genes associated with high methylation. Because when gene is
methylated only then silencing of gene occurs..
A south facing window is 2.1 m high and 4.2 m long. A horizontal diff.pdfomarionmatzmcwill497
A south facing window is 2.1 m high and 4.2 m long. A horizontal diffuse reflector is places in
front of the window and hinged at the bottom edge of the window. Radiation data for an hour are
I = 1.61 MJ/m^2, I_d = 0.33 MJ/m^2, I_b = 1.28 MJ/m^2 and R_b = 2.31. If the (diffuse)
reflectance of the reflector is 0.85, what will be the total irradiation per unit area on the window?
Solution
we know that total radiation=incident radiation=beamed radiation.
Write an extended summary (They say”) of Sheryl Sandbergs Lean.pdfomarionmatzmcwill497
Write an extended summary (\"They say”) of Sheryl Sandberg\'s \"Lean In: What Would You Do
If You Weren\'t Afraid.\" In your last paragraph, make a claim about Sandberg\'s essay(\"I
Say\"). Use this template to frame the \"I Say\" paragraph:
My own experience yields a point that is similar/different/both similar and different. (INSERT
A BRIEF PERSONAL STORY HERE THAT IS RELEVANT. YOUR STORY CAN BE
BASED ON YOUR WORK EXPERIENCE, YOUR SCHOOL EXPERIENCE, OR AN
EXPERIENCE YOU HAVE HEARD ABOUT. You can use other evidence, but I want you to
focus on the summary here, so there is no need to invest tons of time researching and reading.
) What I take away from my own experience/this example/this research is.....
Solution
Although this question is also not related with Economics.
But I would like to share my real experience here-I had only one brother ( we are 4 sisters and 1
brother ) .He was very pempared from the childhood. My father was a doctor ,he loved his five
kids equally, but my mother and two elder sisters always pampered him.He could not get proper
education even after his marrige he was not able to take proper decisions.But he was very good
and loveble persone. He loved me very much .In 2013 Feb-Doctore declared that he was in the
last stage of cencer.Although he was feeling some problem last six months but he ignored
them.He never told me about his problems.He always pretented that he was very happy and
healthy.But when he was not able to tolerate he told me and showed me all reports.that time he
was weeping bitterly .I took him in many hospitals but was not able to save his life.It was the
greatest lose of life..
Write a program that will prompt a user to input their name(first .pdfomarionmatzmcwill497
Write a program that will prompt a user to input their name
(first and last).
Ex: Please enter your first and last name: John Doe
Then, output the string.
Next, prompt the user to input their nickname.
Ex: Enter your nickname: Rowdy
Then modify the name string to consist of the person’s first name, nickname (in all caps,
enclosed in double quotes) and last name.
Then output the modified string.
Ex: John “ROWDY” Doe
NOTE: This program should loop, prompting the user to decide whether or not he or she wishes
to enter another name.
Ex: Do you wish to enter another name(y/n)?
Solution
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
public class MainClass {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String name,nickname,first,last;
char choice;
do
{
System.out.println(\"Please enter your first and last name: \");
name = input.nextLine();
System.out.println(\"Your name is : \"+name);
System.out.println(\"Please enter your nickname\");
nickname = input.nextLine();
nickname = nickname.toUpperCase();
first = name.split(\" \")[0];
last = name.split(\" \")[1];
name = first + \" \\\"\" + nickname + \"\\\" \" + last;
System.out.println(\"Modified name is : \"+name);
System.out.println(\"Do you wish to enter another name(y/n)?\");
choice = input.next().toLowerCase().charAt(0);
input.nextLine();
}while(choice!=\'n\');
}
}
OUTPUT:
run:
Please enter your first and last name:
John Doe
Your name is : John Doe
Please enter your nickname
Rowdy
Modified name is : John \"ROWDY\" Doe
Do you wish to enter another name(y/n)?
y
Please enter your first and last name:
David Beckham
Your name is : David Beckham
Please enter your nickname
Becks
Modified name is : David \"BECKS\" Beckham
Do you wish to enter another name(y/n)?
n
BUILD SUCCESSFUL (total time: 18 seconds).
With a blow count of 14 the density of the soil is Select one 15e bit.pdfomarionmatzmcwill497
With a blow count of 14 the density of the soil is Select one 15e bitery dense. SC. Medium
Solution
solution-
if blow count is between 4 to 10 then the soil is loose, if blow count is between 10 to 30 then it
will be medium dense and if it is between 30 and 50 then it will be dense and greater than 50
means soil is very dense.
Here no of blow count is 14 it means soil is medium dense.Hence option c is correct.
Which process(es) can move solutes against concentration gradients (.pdfomarionmatzmcwill497
Which process(es) can move solutes against concentration gradients? (from low to high
concentration) Passive Diffusion Facilitated Diffusion Active Transport Secondary Transport
Active Transport Active and Secondary Transport Active, Secondary Transport and Facilitated
Diffusion All processes
Solution
The correct answer is Active transport.
Rest all the categories are types of diffusion. Diffusion always occurs down or along the
concentration gradient, whethrr with or without support of carrier molecule.
Transport which occurs against the concentration gradient, uses ATP and is ACTIVE
TRANSPORT..
What role do piRNAs play Serve as atemplate for transposon silencin.pdfomarionmatzmcwill497
What role do piRNAs play? Serve as atemplate for transposon silencing. Serve as a guide to
mRNA degradation enzymes. Structural component of some ribozymes. Antisense RNA
involved in RNA processing. Silences the second X chromosome in human females.
Solution
(20) a. serve as a template for transposon silencing.
The majority of piRNAs are antisense to transposon sequences, suggesting that they serve as
templates to silence transposons.
what was the PRIMARY cause of the current Greece Crisis Excessive g.pdfomarionmatzmcwill497
what was the PRIMARY cause of the current Greece Crisis? Excessive government spending,
lack o
Solution
The Greek economic crisis is the result of multiple reasons, like slow down of GDP growth rate,
higher government deficit and government debt. But the primary reason is excessive government
spending that was not matched by adequate tax reveneue. This resulted in highe government
(fiscal) deficit which was funded by higher borrowing. Higher government debt led to the
soverign debt crisis in Greece..
Three LR circuits are made with the same resistor but different induc.pdfomarionmatzmcwill497
Three LR circuits are made with the same resistor but different inductors. The figure shows the
current of the circuits as a function of time. Show on the time scale the approximate locations of
tau of each plot. Rank the three inductors according to the value of inductance, L.
Solution
Order:L3>L2>L1
Explanation: I=io×e^(-t/LR)
As L increases I decreases rapidly.
There are several things fundamentally wrong in this illustration. Po.pdfomarionmatzmcwill497
There are several things fundamentally wrong in this illustration. Point out two of them. Point
them out, describe why they are wrong, and what they were supposed to be. You can look up
anything (especially the lecture 12). size or shape of illustration do not apply (e.g. RNA primer
looks like only a few bases, but that is okay, or Helicase is triangular, but that is fine, too).
Solution
1: Since lagging strand is discontinuously synthesized in form of Okazaki fragments, RNA
primer serve to form primer for synthesis of each of these fragments. So, RNA primer should be
located adjacent to the DNA pol at lagging strand.
2: DNA pol alpha serve to form RNA/DNA primers for lagging strand synthesis. These primers
are then exptended by DNA pol delta. At lagging strand, only DNA pol alpha is shown..
The poor are available to do the unpleasant jobs that no one .pdfomarionmatzmcwill497
The poor are available to do the unpleasant jobs that no one else wants to do.
The poor purchase goods, such as those of poor quality, that otherwise could not be sold
Jobs are established for those people, such as social workers, who provide services to the
poor.
All of the above are true.
Conflict theorists view poverty as functional for our society.
Functionalists believe poverty could best be dealt with if the poor became politically aware
and active, organizing themselves to reduce inequality through government action.
Conflict theorists assume that since there is such enormous wealth in modern societies, no
one in these societies should go without satisfaction of their essential needs.
To resolve the poverty problem, functionalists urge elimination of the stigma and negative
definitions associated with poverty.
Problem-solving approach
Disarming
Win-lose approach
Role reversal
The conflict is defined as a win-lose situation.
Each side seeks solutions to meet only its needs.
Each side attempts to force the other side into submission.
Each side honestly and openly communicates its goals, needs, and ideas.
Stroking
Role reversal
Mediation
Disarming
Expectation
Verification
Threshold/perceptual reorientation
Appreciation
Functional aspects of poverty for affluent groups include: (Points : 2)
The poor are available to do the unpleasant jobs that no one else wants to do.
The poor purchase goods, such as those of poor quality, that otherwise could not be sold
Jobs are established for those people, such as social workers, who provide services to the
poor.
All of the above are true.The following is true about theoretical explanations of poverty:
(Points : 2)
Conflict theorists view poverty as functional for our society.
Functionalists believe poverty could best be dealt with if the poor became politically aware
and active, organizing themselves to reduce inequality through government action.
Conflict theorists assume that since there is such enormous wealth in modern societies, no
one in these societies should go without satisfaction of their essential needs.
To resolve the poverty problem, functionalists urge elimination of the stigma and negative
definitions associated with poverty.Question 16 of 25With the following conflict resolution
approach, the two sides engaged in the conflict attempt to sell their own solution without really
listening to the other side: (Points : 2)
Problem-solving approach
Disarming
Win-lose approach
Role reversal
Question 17 of 25The following is true about the problem-solving approach to resolving
conflict: (Points : 2)
The conflict is defined as a win-lose situation.
Each side seeks solutions to meet only its needs.
Each side attempts to force the other side into submission.
Each side honestly and openly communicates its goals, needs, and ideas.
Question 18 of 25In resolving conflict, the strategy of finding some truth in what the other
person (or side) is saying and then expressing “agreement” is: (Points : 2)
Str.
Suppose that 14 of people are left handed. If you pick two people a.pdfomarionmatzmcwill497
Suppose that 14% of people are left handed. If you pick two people at random, what is the
probability that
(1) they both are left handed? (round your answer to 2 decimal places)
(2) only one of them is left handed? (round your answer to 2 decimal places)
Solution
1)
P(both left handed) = 0.14*0.14 = 0.0196 [ANSWER]
********************
b)
There are two ways to do this, that is, the first one is left handed and the scond is right handed, or
the other way around.
Hence, we mutliply the product of probabilities by 2:
P(one is left handed) = 2*0.14*(1-0.14) = 0.2408 [ANSWER].
Please help me with these General Biology 1 (Bio 111) questions. You.pdfomarionmatzmcwill497
Please help me with these General Biology 1 (Bio 111) questions. Your response will be highly
appreciated.
1. Describe the following bonds (use examples): ionic bond, polar covalent bond, nonpolar
covalent bond, and hydrogen bond.
2. What are the properties of water? Describe each property being sure to include the following
terms: hydrophobic, hydrophilic, evaporation, cohesion, adhesion, capillarity, solvent, solute,
and solution.
3. What does the pH scale measure? What is the range on the scale? What values indicate acid,
indicate base and indicate neutral?
4. Describe the following bonds (use examples): ionic bond, polar covalent bond, nonpolar
covalent bond, and hydrogen bond.
5. What are the properties of water? Describe each property being sure to include the following
terms: hydrophobic, hydrophilic, evaporation, cohesion, adhesion, capillarity, solvent, solute,
and solution.
Solution
(1)
Ionic bonds result when complete transfer of valence electron(s) between atoms
Example: NaCl, KCl
Covalent bonds result when valence electrons are shared between atoms.
Polar covalent bonding is a type of chemical bond where a pair of electrons is unequally shared
between two atoms: Example: HCl,
Nonpolar covalent bonds are a type of chemical bond where two atoms share a pair of electrons
with each other. Example: CCl3, H2
A hydrogen bond is the attractive force between the hydrogen attached to an electronegative
atom of one molecule and an electronegative atom of a different molecule
Example: Hydrogen bonding occurs between electronegative oxygen of water with hydrogens of
other water molecules..
NEED HELP ON C HOMEWORKIntroduction Programmers for a Better Tomo.pdfomarionmatzmcwill497
NEED HELP ON C HOMEWORK
Introduction: Programmers for a Better Tomorrow
Programmers for a Better Tomorrow is an organization dedicated to helping charities, medical
societies, and scholarship organizations manage various tasks so that they can focus on making
the world a better place! They have asked you and your classmates to help them develop some
new programs to benefit their organizations.
Problem: Food Bank Management (foodbank.c)
Programmers for a Better Tomorrow is now in partnership with a local Food Bank which
distributes food items to people in need. People come in to a Food Bank and make their
donations, and others might come in to make a request for any food item they want.
A Food Bank Management Program is used to keep track of the stock the Food Bank has (i.e.,
the donations), keep a record of requests that come in, fulfilling requests and printing the status
report which consists of the amount of stock present in the food bank and the requests that are
not yet fulfilled.
The program will require you to make at least one array. You may choose to make multiple one-
dimensional arrays: one to serve as a Donations Table and one to serve as a Request Table. The
index of the array will represent the inventory type. The value in the array will represent the
amount present or needed of that type.
You may, instead, choose to combine these to two arrays into a single two-dimensional array.
There are 5 inventory types:
Protein
Dairy
Grains
Vegetables
Fruits
Your program should allow the user the following options:
Enter a Donation
Enter a Request
Fulfill Requests
Print status report
Exit
Option 1:
Ask the user for the inventory type and amount of the donation to be made. When the donation
has been added to the donations table, the program should notify the user by printing out
“Donation Added”.
Option 2:
Ask the user for the inventory type and amount of the request to be made. When the request has
been added to the requests table, the program should notify the user by printing out “Request
Added”.
Option 3:
Check each type of inventory in the Request Table.
For each item that has a value in the request table, check to see if there is inventory of the same
type in the donations table.
If there are no donations of that type, print “ requests cannot be fulfilled.” Replace with the
correct inventory type (Dairy, Fruit, etc.).
If there is some inventory in the donations table, but not enough to process all requests, print “
requests will be partially fulfilled”. Reduce both the donation and request amounts based on how
much of the request was able to be fulfilled. Replace with the correct inventory type (Dairy,
Fruit, etc.).
If there is enough inventory to fulfill the request, print “type x> requests will be fulfilled.”
Reduce the appropriate amount from the Donations Table and remove the amount from the
Request Table. Replace with the correct inventory type (Dairy, Fruit, etc.).
Option 4:
Print both tables, indicating which is for donations a.
Problem 14. Your probability class has 250 undergraduate students and.pdfomarionmatzmcwill497
Problem 14. Your probability class has 250 undergraduate students and 50 graduate students.
The probability of an undergraduate (or graduate) student getting an A is 1/3 (or 1/2,
respectively). Let X be the number of students that get an A in your class. (a) Calculate E[X] by
first finding the PMF of X. (b) Calculate E[X] by viewing X as a stun of random variables,
whom, mean is easily calculated.
Solution.
Simplify each expression. Write all ansers without using negative ex.pdfomarionmatzmcwill497
Simplify each expression. Write all ansers without using negative exponents. Assume that all
variables are restricted to those numbers for which the expression is define.
(x/y3)4
-2x0
Please solve the problems and show your work, thank you. =)
Solution
(x/ y^3)^4
1st we will remove parentheses and distribute exponent
x^4/ y^12 so we got this as final answer.
Our understanding of genetic inheritance and the function of DNA i.pdfomarionmatzmcwill497
Our understanding of genetic inheritance and the function of DNA in producing the
characteristics of the individual have been developing for more than 150 years. Consider our
current state of knowledge. Link genetic characteristics to DNA structure. Explain how DNA
through the process of protein synthesis is responsible for the ultimate expression of the
characteristics in the organism. Describe how interference in protein synthesis can result in
disruption of cellular and bodily processes? How does the significance of one class of proteins,
the enzymes, relate to the importance of proper nutrition throughout life?
Our understanding of genetic inheritance and the function of DNA in producing the
characteristics of the individual have been developing for more than 150 years. Consider our
current state of knowledge. Link genetic characteristics to DNA structure. Explain how DNA
through the process of protein synthesis is responsible for the ultimate expression of the
characteristics in the organism. Describe how interference in protein synthesis can result in
disruption of cellular and bodily processes? How does the significance of one class of proteins,
the enzymes, relate to the importance of proper nutrition throughout life?
Solution
1.The gene encoding the production of protein is transcribed into the gene language required for
the next stage which is RNA. The RNA is then transcribed into protein for protection or the
function assigned. This is a simple illustration of how DNA can regulate expression of
characteristics.There are 2 parts to this process:translation and transcription.The gene for a
particular trait undergoes a process called transcription. This is a process in which the language
of the body\'s make-up is transcribed from one cell language to another (DNA to RNA) which
the body will recognize in order to carry out the next process. The next process is the translation
of the information from RNA to the actual product, which is the protein. Specific proteins play
specific roles so the body synthesizes the specific protein for the specific job at the specific time.
2.Errors in protein synthesis disrupt cellular fitness, cause disease phenotypes, and shape gene
and genome evolution.errors in protein synthesis reduce organism fitness: disruption of
translational fidelity with common antibiotics such as streptomycin and kanamycin kills bacteria;
cells with impaired translational proofreading ability display altered morphologies and suffer
severe fitness defects, as do cells with elevated rates of transcription errors in an essential gene;
defects in translational fidelity and in protein folding cause disease phenotypes in mouse
models.Synthesis and degradation of non-functional proteins may also be costly without being
obviously harmful. Ribosomal throughput dedicated to a polypeptide that will ultimately fail to
function represents an opportunity cost, particularly for fast-growing organisms. Expression of
quality control systems, .
Please Explain. Compute the worst case time complexity of the follow.pdfomarionmatzmcwill497
Please Explain. Compute the worst case time complexity of the following algorithm. for i = n to
2n do for j = i - n to n do print (i, j).
Solution
for i=n to 2n do
for j=i-n to n do
print (i, j)
Here we have two loops:
1. outer for loop: runs for i=n to 2n : n times
2. inner for loop:
for each value of i, it run :
0 to n
1 to n
2 to n
.......
.......
n-1 to n
n to n
So, T(n): n + (n-1) + (n-2)+ .......+1
= n(n+1)/2
Big-O : O(n^2).
3. Variance of exponential and uniform distributions(a) Compute Va.pdfomarionmatzmcwill497
3. Variance of exponential and uniform distributions
(a) Compute Var[Y ] when Y Exp(1) and when Y Unif(0, 1).
(b) Show that
i. if Y Unif(a, b), then X = (Y a)/(b a) Unif(0, 1), where a < b.
ii. if Y Exp(), then X = Y Exp(1) where > 0. Hint: Compute FX(x) = P(X x) = P(Y ?).
(c) Combine (a) and (b) to obtain Var[X] when X Exp() and when X Unif(a, b).
Solution.
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Each team works on assigned sorting algorithms and will give demonstr.pdf
1. Each team works on assigned sorting algorithms and will give demonstration and PowerPoint
presentation on Nov. 16^th during lab class. Search internet for tutorials and source code in
python on sorting algorithms assigned to your team. Modify the python code to count the number
of comparisons and the number of swaps when sorting a random list of size n, n>=100, for
example, n = 100, 1000, 10000. To test your program use a small size of n for example, n = 10,
and print the list before and after sorting. Once confirmed the your program sorts correctly, try
larger size of n without print the list. In your presentation, explain how do the sorting algorithms
work and given their worst case and average case complexity, and include following table:
Submit the source code and presentation to D2L Assignment for Team Project 1 before
11:00PM. 11/16/2016 Sorting Algorithms: Selection sort, quick sort Insertion sort, shell sort
Bubble sort, merge sort Heap sort Radix sort
Solution
Selection Sort:
def selectionSort(list1):
for x in range(len(list1)-1,0,-1):
max_pos=0
for location in range(1,x+1):
if list1[location]>list1[max_pos]:
max_pos = location
temp = list1[x]
list1[x] = list1[max_pos]
list1[max_pos] = temp
list1 = [100,550,12,10,9]
selectionSort(list1)
print "Sorted List"
print(list1)
================================================
Output:
Sorted List
[9, 10, 12, 100, 550]
==================================================
Quck sort
def quickSort(list1):
quickSortHelper(list1,0,len(list1)-1)
2. def quickSortHelper(list1,left,right):
if left= pivot and r >= l:
r = r -1
if r < l:
done = True
else:
temp = list1[l]
list1[l] = list1[r]
list1[r] = temp
temp = list1[left]
list1[left] = list1[r]
list1[r] = temp
return r
list1 = [100,550,12,10,9]
quickSort(list1)
print(list1)
=============================================
Output:
[9, 10, 12, 100, 550]
=================================================
insertion sort:
def insertionSort(list1):
for i in range(1,len(list1)):
currentvalue = list1[i]
position = i
while position>0 and list1[position-1]>currentvalue:
list1[position]=list1[position-1]
position = position-1
list1[position]=currentvalue
list1 = [100,550,12,10,9]
insertionSort(list1)
print(list1)
===================================================
Output:
[9, 10, 12, 100, 550]
3. =================================================
Bubble sort:
def bubbleSort(list1):
for x in range(len(list1)-1,0,-1):
for i in range(x):
if list1[i]>list1[i+1]:
temp = list1[i]
list1[i] = list1[i+1]
list1[i+1] = temp
list1 = [100,550,12,10,9]
bubbleSort(list1)
print(list1)
======================================
Output:
[9, 10, 12, 100, 550]
====================================
def mergeSort(list1):
print("Splitting list ",list1)
if len(list1)>1:
mid = len(list1)//2
lefthalf = list1[:mid]
righthalf = list1[mid:]
mergeSort(lefthalf)
mergeSort(righthalf)
i=0
j=0
k=0
while i < len(lefthalf) and j < len(righthalf):
if lefthalf[i] < righthalf[j]:
list1[k]=lefthalf[i]
i=i+1
else:
list1[k]=righthalf[j]
j=j+1
k=k+1
while i < len(lefthalf):
5. length = len( list1 ) - 1
Parent = length / 2
for i in range ( Parent, -1, -1 ):
downAdjust( list1, i, length )
# flatten heap into sorted array
for i in range ( length, 0, -1 ):
if list1[0] > list1[i]:
swap( list1, 0, i )
downAdjust( list1, 0, i - 1 )
def downAdjust( list1, first, last ):
largest = 2 * first + 1
while largest <= last:
# right child exists and is larger than left child
if ( largest < last ) and ( list1[largest] < list1[largest + 1] ):
largest += 1
# right child is larger than parent
if list1[largest] > list1[first]:
swap( list1, largest, first )
# move down to largest child
first = largest;
largest = 2 * first + 1
else:
return # force exit
def swap( A, x, y ):
tmp = A[x]
A[x] = A[y]
A[y] = tmp
list1 = [100,550,12,10,9]
heapsort(list1)
6. print(list1)
=====================================
Output:
akshay@akshay-Inspiron-3537:~/Chegg$ python heap.py
[9, 10, 12, 100, 550]
============================================
Radix sort
def radixsort( list1 ):
div = 10
Length = False
tmp , placement = -1, 1
while not Length:
Length = True
# declare and initialize buckets
buckets = [list() for _ in range( div )]
# split list1 between lists
for i in list1:
tmp = i / placement
buckets[tmp % div].append( i )
if Length and tmp > 0:
Length = False
# empty lists into list1 array
a = 0
for b in range( div ):
buck = buckets[b]
for i in buck:
list1[a] = i
a += 1
# move to next digit
placement *= div
list1 = [100,550,12,10,9]
radixsort(list1)
![Each team works on assigned sorting algorithms and will give demonstration and PowerPoint
presentation on Nov. 16^th during lab class. Search internet for tutorials and source code in
python on sorting algorithms assigned to your team. Modify the python code to count the number
of comparisons and the number of swaps when sorting a random list of size n, n>=100, for
example, n = 100, 1000, 10000. To test your program use a small size of n for example, n = 10,
and print the list before and after sorting. Once confirmed the your program sorts correctly, try
larger size of n without print the list. In your presentation, explain how do the sorting algorithms
work and given their worst case and average case complexity, and include following table:
Submit the source code and presentation to D2L Assignment for Team Project 1 before
11:00PM. 11/16/2016 Sorting Algorithms: Selection sort, quick sort Insertion sort, shell sort
Bubble sort, merge sort Heap sort Radix sort
Solution
Selection Sort:
def selectionSort(list1):
for x in range(len(list1)-1,0,-1):
max_pos=0
for location in range(1,x+1):
if list1[location]>list1[max_pos]:
max_pos = location
temp = list1[x]
list1[x] = list1[max_pos]
list1[max_pos] = temp
list1 = [100,550,12,10,9]
selectionSort(list1)
print "Sorted List"
print(list1)
================================================
Output:
Sorted List
[9, 10, 12, 100, 550]
==================================================
Quck sort
def quickSort(list1):
quickSortHelper(list1,0,len(list1)-1)](https://image.slidesharecdn.com/eachteamworksonassignedsortingalgorithmsandwillgivedemonstr-230705091939-39d60dbd/85/Each-team-works-on-assigned-sorting-algorithms-and-will-give-demonstr-pdf-1-320.jpg)
![def quickSortHelper(list1,left,right):
if left= pivot and r >= l:
r = r -1
if r < l:
done = True
else:
temp = list1[l]
list1[l] = list1[r]
list1[r] = temp
temp = list1[left]
list1[left] = list1[r]
list1[r] = temp
return r
list1 = [100,550,12,10,9]
quickSort(list1)
print(list1)
=============================================
Output:
[9, 10, 12, 100, 550]
=================================================
insertion sort:
def insertionSort(list1):
for i in range(1,len(list1)):
currentvalue = list1[i]
position = i
while position>0 and list1[position-1]>currentvalue:
list1[position]=list1[position-1]
position = position-1
list1[position]=currentvalue
list1 = [100,550,12,10,9]
insertionSort(list1)
print(list1)
===================================================
Output:
[9, 10, 12, 100, 550]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)