Answer:
I think we are so this is hard lol
Explanation:
we are not too dependable
things that show this is library are still open, school sports teams still flourish(if we were too depending on them they wouldnt) they help us plan ways to interact in person if we were too dependent businesses would struggle more and only be online
this is hard if I can think of any others I'll come back I'm sorry if this isn't any help
The size of a list of integers can be found using python as follows;
size = len(list1)
<h3>How to find the size of a list using python?</h3>
The size of a list can be found using the len() function in python.
According to the question, the list is an integer.
Therefore, let's use an example below:
list1 = [1, 2, 1, 3, 6, 7, 8, 9, 4, 7, 8, 6, 4]
size = len(list1)
print(size)
Therefore, the size of a list of integers can be found using the len() function in python.
learn more on python here: brainly.com/question/14989942
#SPJ1
Answer:
DRAM and SRAM
Explanation:
Cache memory is used to reduce the average time to access data from the Main memory.
SRAM is an on-chip memory whose access time is small (fast).
DRAM is an off-chip memory which has a large access time (slow).
your laptop has too many programs running and the computer cannot keep up with them which causes the laptop to overheat. the fan is running at a normal pace, it's just not fast enough to cool down the laptop because there are too many programs running bogging down the system.
Given an array of integers (both odd and even), sort them in such a way that the first part of the array contains odd numbers sorted in descending order, rest portion contains even numbers sorted in ascending order.
Explanation:
- Partition the input array such that all odd elements are moved to left and all even elements on right. This step takes O(n).
- Once the array is partitioned, sort left and right parts individually. This step takes O(n Log n).
#include <bits/stdc++.h>
using namespace std;
void twoWaySort(int arr[], int n)
{
int l = 0, r = n - 1;
int k = 0;
while (l < r) {
while (arr[l] % 2 != 0) {
l++;
k++;
}
while (arr[r] % 2 == 0 && l < r)
r--;
if (l < r)
swap(arr[l], arr[r]);
}
sort(arr, arr + k, greater<int>());
sort(arr + k, arr + n);
}
int main()
{
int arr[] = { 1, 3, 2, 7, 5, 4 };
int n = sizeof(arr) / sizeof(int);
twoWaySort(arr, n);
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
return 0;
}
