All categories

4 years ago

What changes do you need to a algorithm to compare 100 numberst

Computers and Technology

1 answer:

Aliun [14]4 years ago

3 0

Answer:

It really depends - in general every data structure has its use.

Explanation:

Furthermore, traversing the list will be inefficient because the data items are not contiguous in memory, forcing the CPU to jump all over the RAM memory causing further slowdown.

You might be interested in

Whichof the following is not a standard method called as part of the JSPlife cycle?jspInit()jspService()_jspService()jspDestroy(

olga nikolaevna [1]

Answer:

jspService()

Explanation:

These are the steps in JSP life cycle-

1. We have to convert JSP page to Servlet.

2.Then we compile the JSP page which convert it into test.java

3. In test.java ,we load the classes(test.class) in container.

4. Object(instance) is created in container .

5. Then, we initialize the init() method at the time of servlet generation.

6. After the initialization,for the requests we use _jspService() method to serve the incoming requests from JSP.

7. When the work of JSP is completed, we remove it from container by the help of jspDestroy() method.

There is no jspService() method in the JSP life cycle.

7 0

3 years ago

write a python function that takes the largest and smallest numbers in a list, and swap them (without using min() or max() )

Akimi4 [234]

Answer:

def SwapMinMax ( myList ):

myList.sort()

myList[0], myList[len(myList)-1] = myList[len(myList)-1], myList[0]

return myList

Explanation:

By sorting the list, you ensure the smallest element will be in the initial position in the list and the largest element will be in the final position of the list.

Using the len method on the list, we can get the length of the list, and we need to subtract 1 to get the maximum element index of the list. Then we simply swap index 0 and the maximum index of the list.

Finally, we return the new sorted list that has swapped the positions of the lowest and highest element values.

Cheers.

8 0

3 years ago

Implement a method called bubbleSort, that takes an ArrayList, sorts it using bubble sort algorithm, and returns a sorted list;

boyakko [2]

Answer:

Java algorithm is given below

Explanation:

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Random;

public class Temp {

static void bubbleSort(ArrayList<Integer> list) {

int n = list.size();

for (int p = 0; p < n - 1; p++)

for (int q = 0; q < n - p - 1; q++)

if (list.get(q) > list.get(q + 1)) {

int temp = list.get(q);

list.set(q, list.get(q + 1));

list.set(q + 1, temp);

}

static void selectionSort(ArrayList<Integer> list) {

int n = list.size();

for (int p = 0; p < n - 1; p++) {

int minimumIndex = p;

for (int q = p + 1; q < n; q++)

if (list.get(q) < list.get(minimumIndex))

minimumIndex = q;

int temp = list.get(p);

list.set(p, list.get(minimumIndex));

list.set(minimumIndex, temp);

}

static void insertionSort(ArrayList<Integer> list) {

int size = list.size();

int p, val, q;

for (p = 1; p < size; p++) {

val = list.get(p);

q = p - 1;

while (q >= 0 && list.get(q) > val) {

list.set(q + 1, list.get(q));

q = q - 1;

}

list.set(q + 1, val);

}

static void mergeSort(ArrayList<Integer> list, int low, int high) {

if (low < high && (high - low) >= 1) {

int mid = (high + low) / 2;

mergeSort(list, low, mid);

mergeSort(list, mid + 1, high);

merger(list, low, mid, high);

}

static void merger(ArrayList<Integer> list, int low, int mid, int high) {

ArrayList<Integer> mergedArray = new ArrayList<Integer>();

int left = low;

int right = mid + 1;

while (left <= mid && right <= high) {

if (list.get(left) <= list.get(right)) {

mergedArray.add(list.get(left));

left++;

} else {

mergedArray.add(list.get(right));

right++;

}

while (left <= mid) {

mergedArray.add(list.get(left));

left++;

}

while (right <= high) {

mergedArray.add(list.get(right));

right++;

}

int i = 0;

int j = low;

while (i < mergedArray.size()) {

list.set(j, mergedArray.get(i++));

j++;

}

public static void main(String[] args) throws Exception {

ArrayList<Integer> list = new ArrayList<>();

Random rand = new Random(System.currentTimeMillis());

for (int i = 0; i < 10000; i++) {

list.add(rand.nextInt(256));

}

long start = System.currentTimeMillis();

selectionSort(list);

int sel = (int) (System.currentTimeMillis() - start);

System.out.println("Selection Sort time (in ms): " + sel);

list.clear();

// ------------------------

rand = new Random(System.currentTimeMillis());

for (int i = 0; i < 10000; i++) {

list.add(rand.nextInt(256));

}

start = System.currentTimeMillis();

insertionSort(list);

int ins = (int) (System.currentTimeMillis() - start);

System.out.println("Insertion Sort time (in ms): " + ins);

list.clear();

// ------------------------

rand = new Random(System.currentTimeMillis());

for (int i = 0; i < 10000; i++) {

list.add(rand.nextInt(256));

}

start = System.currentTimeMillis();

bubbleSort(list);

int bub = (int) (System.currentTimeMillis() - start);

System.out.println("Bubble Sort time (in ms): " + bub);

list.clear();

// ---------------------------

rand = new Random(System.currentTimeMillis());

for (int i = 0; i < 10000; i++) {

list.add(rand.nextInt(256));

}

start = System.currentTimeMillis();

mergeSort(list, 0, list.size() - 1);

int mer = (int) (System.currentTimeMillis() - start);

System.out.println("Merge Sort time (in ms): " + mer);

long m = Math.min(Math.min(sel, ins), Math.min(bub, mer));

if (m == sel)

System.out.println("Selection Sort is fastest");

else if (m == ins)

System.out.println("insertion Sort is fastest");

else if (mer == m)

System.out.println("Merge Sort is fastest");

else if (m == bub)

System.out.println("Bubble Sort is fastest");

}

6 0

3 years ago

Help plsssssssssssssssssssss

antiseptic1488 [7]

I’m pretty sure C or A

7 0

3 years ago

How has social media influenced the marketing and PR activities of companies? Explain in what ways companies, individuals, and N

Lesechka [4]

Social Media has infuenced marketing for many years because the fact hat they can advertise on socal easily because people spend so much time on social media a day so yea!

3 0

3 years ago