All categories

3 years ago

What is bubblesort and how do u do it

Computers and Technology

1 answer:

zloy xaker [14]3 years ago

3 0

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm

You might be interested in

Which of the following is not regression test case? A. A representative sample of tests that will exercise all software function

AveGali [126]

Answer:

D. Low-level components are combined into clusters that perform a specific software sub-function

Explanation:

Normally, regression testing are done on a manual basis by simply re-executing a subset of the entire available test cases or it can be done automatically by utilizing playback tools or automated capture. Hence, from the options, a combination of low-level components into clusters that perform a specific sub-function does not align with how regression testing are done either manually or automatically.

6 0

3 years ago

Instant messaging is synchronous

ASHA 777 [7]

True; synchronous means existing or occurring at the same time (I really don't know if that's a question but oh well)

7 0

3 years ago

Mr. Stevens is the principal of a high school. Why might he want to export data from a database of students’ exam scores?

Anna007 [38]

I am not sure but I think that it is either the First option or the Third option but you would probably need more information.

7 0

3 years ago

Read 2 more answers

Each symbol of an octal number corresponds to 3 bits of a binary number. is it true or false

grin007 [14]

Answer: True.

Explanation: It uses only the 3 bits to represent any digit in binary and easy to convert from octal to binary and then to vice-versa. Hope that helps

5 0

3 years ago

Given a sorted array of integers created on the heap, its size and a new integer, design a function which will enlarge the array

Debora [2.8K]

Using the computational language in C++ to write a code that will organize the values in an array through a mathematical condition.

<h3>writing code in C++</h3>

#include <bits/stdc++.h>

using namespace std;

int getIndexInSortedArray(int arr[], int n, int idx)

{

/* Count of elements smaller than current

element plus the equal element occurring

before given index*/

int result = 0;

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

if (arr[i] < arr[idx])

result++;

if (arr[i] == arr[idx] && i < idx)

result++;

}

return result;

}

int main()

{

int arr[] = { 3, 4, 3, 5, 2, 3, 4, 3, 1, 5 };

int n = sizeof(arr) / sizeof(arr[0]);

int idxOfEle = 5;

cout << getIndexInSortedArray(arr, n, idxOfEle);

return 0;

}

See more about C++ at brainly.com/question/12975450

#SPJ1

7 0

2 years ago