Answer:
Apple is a luxury brand due to it stable products, expensive products, and its releasing phones costing $1,000 or more and moving its services to the higher end
Explanation:
The steps I would take are 1. Making a strong password with symbols and numbers. 2. I will set up a 2 way authentication ther for if someone would be trying to hack me I would get an alert in order to stop the attempt. 3 I will not use the same password each time.
Organic light emitting diode,
Technology is a category not a specific thing
Answer:
Online activities are increasingly used to make real-world decisions.
Explanation:
People use increasingly <em>world wide web</em>. They create profiles and communicate with others on social networks, share thoughts and moments of their life on online platforms.
These <em>online</em> activities become part of one's identity. Therefore these activities can give information about user's behaviors, attitudes, likes and dislikes.
All this data are being used to make real world decisions about a user or a group of users. For example, trough one's online check-ins, frequently used location of the users or can be determined. Similarly, trough social media likes or posts, one's hobbies can be predicted.
Therefore, social media and online presence in general, is not necessarily safe or private but important places which have valuable information of the users that can be used in real world.
Answer:
- import java.util.Arrays;
- import java.util.Scanner;
-
- public class Main {
- public static void main(String[] args) {
- int numArr [] = new int[10];
- Scanner input = new Scanner(System.in);
- System.out.print("Input number: ");
- int num = input.nextInt();
- int i = 0;
- while(num != -1){
- numArr[i] = num;
- i++;
- System.out.print("Input number: ");
- num = input.nextInt();
- }
-
- selectionSortDescendTrace(numArr);
- }
-
- public static void selectionSortDescendTrace(int [] arr){
- for(int i =0 ; i < arr.length - 1; i++){
- int largest = arr[i];
- int largeIndex = i;
-
- for(int j= i + 1; j < arr.length; j++ ){
- if(arr[j] > largest){
- largest = arr[j];
- largeIndex = j;
- }
- }
-
- int temp = arr[i];
- arr[i] = arr[largeIndex];
- arr[largeIndex] = temp;
- System.out.println(Arrays.toString(arr));
- }
- }
- }
Explanation:
The solution code is written in Java.
First, we work on the selectionSortDescendTrace method that takes one input array (Line 21). In the method, we create a nested loops. In the outer loop, we set the current element indexed by i as the largest value and use another variable largeIndex to track the index of largest value (Line 23 -24).
We create inner loop to traverse through the subsequent number after current index-i and compared each of the element by the current largest value (Line 26 - 30). If any of the subsequent element is larger than the current largest value, set the element as largest value and update the largeIndex accordingly (Line 27 - 29).
After completion of inner loop, we swap the position of the current found largest number with the element indexed by current i (Line 33 - 35). Print the partially sorted array (Line 36).
