Write a function (pseudocode is OK) to traverse binary search tree and return the ith node in sorted order.
Write a function (pseudocode is OK) to traverse binary search tree and return the ith node in sorted order.
#include <iostream>
using namespace std;
// perform bubble sort
void bubbleSort(int array[], int size) {
// loop to access each array element
for (int step = 0; step < size; ++step) {
// loop to compare array elements
for (int i = 0; i < size - step; ++i) {
// compare two adjacent elements
// change > to < to sort in descending order
if (array[i] > array[i + 1]) {
// swapping elements if elements
// are not in the intended order
int temp = array[i];
array[i] = array[i + 1];
array[i + 1] = temp;
}
}
}
}
// print array
void printArray(int array[], int size) {
for (int i = 0; i < size; ++i) {
cout << " " << array[i];
}
cout << "\n";
}
int main() {
int data[] = {-2, 45, 0, 11, -9};
// find array's length
int size = sizeof(data) / sizeof(data[0]);
bubbleSort(data, size);
cout << "Sorted Array in Ascending Order:\n";
printArray(data, size);
}
int main() {
int x = 100, y = 100000;
while(x<=100000){
// get starting value of timer
int a[x];
for(int i=0;i<x;i++){
a[i] = Math.random();
}
clock_t start = std::clock();
//code to be timed goes here
bubbleSort(data, x);
// get ending value of timer
clock_t end = std::clock();
x=x*10;
std::cout << (double)(end - start) / CLOCKS_PER_SEC << std::endl;
}
}
Step by step
Solved in 2 steps
