Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
2,651 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear search is an algorithm to find a specific element in an array in most simplified manner . The time complexity of linear search algorithm is O(n). As at max it can find the element at the last index. Everey time it traverse the array it matches the value with the value that needs to be find and returns whenever i... | 2.5 |
2,652 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching is a searching process in which we traverse a ptr while comparing each item \nit has a order of n^2 | 2.5 |
2,653 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | in this every index (data) of the data structure is one by one compared by the desired element. it has time complexity of O(n). | 2.5 |
2,654 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear searching is the type of searching in which no condition to simplify or reduce the number of object to search is applied. It searches according to the command in whole of the object. | 1 |
2,655 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Traversing and comparing each element of the provided array with the key element is called linear searching. It takes O(N) time complexity. | 2.5 |
2,656 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | searching all element in data structure in a simply in which we traverse all element one by one . | 2.5 |
2,657 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear searching refers to searching each element in the array one by one from the first element till you find the target element. | 2.5 |
2,658 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear search is when an item is searched from a list linearly one by one i.e. start to the end\ntime complexity ; 0(n^2) | 2.5 |
2,659 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching is searching that starts at one end and goes to each element in list until all element are searched | 2.5 |
2,660 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | suppose we are given a array \nso, linear searching means running a loop and and traversing through the array with a time complexity of O(n) | 2 |
2,661 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | In linear Search , we traverse the whole array and compare each element of the array with the element to be searched . The time complexity of linear search is O(n); | 2.5 |
2,662 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Searching the element in an array by comparing it one by one to the element in the array staring from position 1 is known as linear search. | 2.5 |
2,663 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear search is defined as the searching is limited to a small text or in small problems. | 0 |
2,664 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | in linear search time complexity is o(n) to search a element in a array it search each index for that element in the given array | 2 |
2,665 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear searching is the searching of the desired element in the given data by traversing all the elements of the data one by one. | 2.5 |
2,666 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear search is searching for a element in list by running loop and compare every element with element we have to find | 2.5 |
2,668 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | in linear searching the search the element in | 0 |
2,669 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | it is a searching technique used in case of linear data structure | 1 |
2,670 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | In linear searching, we search the whole data from starting until we found our data, it consumes huge time in comparison of Binary Search\nWe perform linear search on unsorted data. | 2.5 |
2,671 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching is a type of searching in which searching is done from start and the element is searched linearly until the given value matches the element in array.\nfor example in an array of 10 elements we start from index 0 and traverse until we match the required element. | 2.5 |
2,672 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | the element are being searched one at a time, sequencly, unlike in binear searching. | 2.5 |
2,674 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear Searching is an algorithm to search an element in a linear fashion.\nThis means that we would start checking the elements from the start , move forward one step at a time.\nIf the element is found , then we can return the index.\nElse we can return -1 if we do not find the target element\nIt takes O(n) time comp... | 2.5 |
2,675 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear searching define as the searching of an element in an array by traversing it in one direction of get required element. | 2.5 |
2,676 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | in this we start from the first element of array and continue to look the given element to be searched throughout the array and return 1 if it is present else return 0. | 2.5 |
2,677 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | the searching of element in such a way that , we have to take comparison of first two element first and then take comparison of it and third element . | 2 |
2,678 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching traverses through the array and compared every element with the element that needs to be found until it is found. | 2.5 |
2,679 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear search is the searching technique which help in searching a data in an system and give an output | 2.5 |
2,680 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | searching for the given | 0 |
2,681 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching is one by one check all elements and providing answer | 2.5 |
2,682 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | we use linear search to find the data in array. | 2.5 |
2,683 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | it is searching algorithm in which in which we find a element or key by travsering through each element one by one | 2.5 |
2,684 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching the the searching technique in which we just compare and traverse the array | 2.5 |
2,685 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion and selection sort are different in their working principles. insertion sort uses a reference element and then sorts other elements in relation to the reference element. | 2 |
2,686 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort and selection sorts are different in a way that in insertion sort we insert an element and compare the values with other nodes and swap the values time complexity can be O(n^2) but selection sort time complexity is O(n) | 2 |
2,687 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | the main diffrence between insertion and selection sort as in insertion sort the elements are already in sorted oreder | 1 |
2,688 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Selection sort selects an element and traverse to find the least value smaller than it\nInsertion sort inserts the element at its suitable position in the array | 2.5 |
2,689 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort picks each of the number and places it in the correct position in the current array.\n\nSelection sort picks the element and places on basis of the number itself. | 2 |
2,690 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort takes one element and traverse every place of that array and tries to find best place for that element and place it.\nSelection sort takes one element and compare it with its next and place at its right place .\nThere are max no. of swaps in selection than insertion. | 2.5 |
2,692 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort has less time complexity than selection sort. | 1 |
2,693 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | They have different time complexities | 1 |
2,695 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Both are sorting techniques and they both are different as in insertion sort we divide the array in two parts one the sorted one and other unsorted and we assume that the first element is already sorted and from the unsorted array we try to put that element in correct sequence in the sorted array and in selection sor... | 2.5 |
2,696 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort - it check the element and insertion it to the next position if found greater than next one \nselection sort :- it selects the element from the array and sort it by the end . | 1 |
2,697 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort we insert the given key and compare it with others and arrange the given array in sorted form.\nIn selection sort we select any element and assume it primary key and then comparing each element of the array with that primary key if it lesser than it then arranging the array in sorted form. | 2.5 |
2,698 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort is not an inplace sorting techniques, it requires external storage. Eg: the first element is stored separately and then the next element is compared and based on whether it is smaller or greater its place is decided. Its like arranging cards in two hands.\nSelection sort is inplace sorting technique in w... | 2.5 |
2,699 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | in selection sort the element is place dat the index I after every iteration where as \nin insertion sort the traversal is done for the entire range of (0-n) in every iteration. | 1 |
2,700 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In Insertion sort we find the correct position of ith element in the range (0 - i) positions.\n\nIn selection sort we find the smallest element than place it to the first position and so on. | 2 |
2,701 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort is a basic brute force technique where you find the smallest element in each iteration and place it in the first position in the array and maximum iterations is the size of the array\n\nSelection sort is also a basic brute force technique but here we find the largest element in each iteration and place i... | 2 |
2,702 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Linear searching is a kind of searching in which all the elements are searched 1-1.\n | 0 |
2,703 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort is much like placing the element on the required position just like placing in card by moving the rest of the elements forward to create space for it whereas\nselection sort is putting the biggest the biggest elements on the last position in each step they have bit higher complexity of o(n square). | 2 |
2,705 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort we select an element and compare it one by one with every other element succeeding it for sorting the array whereas in insertion sort | 1 |
2,706 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort we select an element and we compare it with every other element present , and thus succeeding in sorting it | 1 |
2,708 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | element in an array. It is a simple algorithm in which we traverse entire array and check at every position if that element at that position is equal to key. Since we have to compare every element present in array to the key, time complexity of linear search is O(n). Here, n is the size of array. | 0 |
2,709 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Both insertion sort and selection sorts take O(n^2) time t sort an array in average and worst case . but the difference is this \ninsertion : \n\nselection: take a values till particular index and sort them by comperisions and repeat it till array size -1 | 1 |
2,710 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion Sort is when an element is inserted at its correct position while sorting the array.\nSelection sort is when | 1 |
2,711 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sorting the chosen element is placed at its correct position in the array while in selection sorting the smallest element is selected and placed in the sorted part of the array. Insertion sort inserts the element in its position and selection sort selects the desired element and places it in the correct po... | 2.5 |
2,712 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort the element chosen is placed at its correct position in the array while in selection sort the smaller element is placed in the sorted part of the array.\nAlso, in insertion sort the element is placed at the position it belongs to and selection sort selects the position accordingly and place it at the ... | 2.5 |
2,713 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort we the minimum element from the array and and put it at first position. now excluding the first element we do the same process for the remaining array until whole array get traversed and sorted. \nBut in selection sort we start prom first element pick it and compare it with other element starting for... | 2.5 |
2,714 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort, the index of the smallest element is found in the array and it is swapped with the first element of the array. Second smallest is swapped with the second element. This is done until the entire array is sorted(reached the last position).\nIn insertion sort, an element is taken and is inserted in its ... | 2.5 |
2,715 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | in selection sort we start from the first element, take it and compare it with all the other elements, as soon as we get the greater number than the chosen element , we leave the element whereas in insertion sort we continue to sort the further array. | 2 |
2,716 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort:: (references : playing cards) here, we first pick a single element and after that we apply two condition\n1) if upcoming element is larger then we will place it in right side\n2) if upcoming element is lesser then we will place it in left side\n\nselection sort:: in selection sort we use two for loop an... | 2.5 |
2,717 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | in selection sort minimum element is found and placed at starting of array .\nin insertion sort elements are swapped as soon as the small element is found the sort is like arranging deck of cards . | 2.5 |
2,718 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort helps user to insert the number in the sequence and stop as soon as the number is greater than the input number whereas in selection sorts it keeps on going till the final number. | 2 |
2,719 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion Sort- firstly we initialize any no. as min. element from the given array . Then we go to the starting index of the array if that element is lesser than the min. element then swap(min. element , element) and if not then we will move to next index we go on repeating this process till the last-1 index of the a... | 2 |
2,720 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | The difference between insertion and selection sort is | 0 |
2,721 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort we pick the element and insert it in its right position whereas in selection sort we select the element to placed at a particular position. | 1 |
2,722 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort we will insert the element at a specific index position of the array. Whereas in the selection sort we will first traverse the array, place the elements in the correct position by swap . The Time and Space complexities are also different. | 1 |
2,723 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Operations that can be performed on queues are:\n1. Searching.\n2. Sorting.\n3. Deletion.\n4. Insertion.\n | 0 |
2,724 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort is sort of opposite to selection sort. In insertion sort, we treat the first element as already sorted and then add the rest elements one by one such that each element is added at the corrected spot such that the resulting array is already sorted. at nth turn, first n elements are sorted. | 1 |
2,725 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort, elements are inserted one by one in a sorted array, and placed at their correct position (beginning with first element, which is sorted in itself).\nIn selection sort, it traverses to each element and then searches for element smaller than it in the array ahead of it, if found swaps with it and event... | 2.5 |
2,726 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort works by picking an element and storing it in a temporary variable and shifting all the elements smaller that the element before it and then pushing the element in the gap created due to shifting of elements,.\nWhile selection sort selects and element and searches for an element smaller to it from the ne... | 2.5 |
2,727 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | in insertion sort you create an another array to store the sorted values but in selection sort whole operation of sorting the array is performed on the same array. | 1 |
2,728 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | variable, then the whole array is traversed until any element gets matched with key. If no element is found, it returns NO solution but for that it needs to check with each and every element of the Array. Hence, the worst time complexity is O(n), where n is the no. of elements in the array. | 0 |
2,729 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort ,an element is put between two elements of an array while in selection sort ,the element is put ,based on the array comparison. | 1 |
2,730 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort and selection sort are different as insertion sort follows the in-place algorithms while selection sort does not. | 2 |
2,731 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion Sort and selection Sort are different as in selection sort the elements are sorted by comparing with minimum element present in array while in insertion sort the element are sorted based on previous element present in whole array. | 2.5 |
2,732 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sorting after finding the largest or smallest element we insert a suitable function. Whereas in insertion sorting after finding the smallest or largest element we make a swap within the array. | 2 |
2,733 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort we select the smallest or largest element in the array and swap it with the element in the starting position.\nWhereas, in insertion sort we select the smallest or largest element and insert in the appropriate location. | 2.5 |
2,734 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort we select the smallest or largest element from the array and swap it with the starting element whereas in insertion sort we insert a element in the array and swap it with other elements until the array becomes sorted. | 2.5 |
2,735 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort and selection sort are different when based on their time complexity. | 1 |
2,736 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion - \nselection - | 0 |
2,737 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort has a time complexity of O(nlogn) whereas Selection sort is of O(n^2) | 1 |
2,738 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In select sort we have to find the maximum element and accordingly have to put it in the end of the array but in insertion sort we have to take an element and compare it with other element until we find a larger element of which then we have to compare that larger element instead.\nSo the main difference is in insertio... | 2 |
2,739 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort we find the smallest or largest element and insert it in the front or back and keep doing this for other elements until list is sorted while in selection sort we just select random elements and swap them with biggest or smallest elements | 2 |
2,741 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | both defies different worst case time complexities | 0 |
2,742 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort helps you to sort the data as soon as each element is inserted in the array on the spot. It inserts element as soon as it is entered to its correct position.\nSelection sort takes input all at one and them perform operation to sort the data. It takes first element and then swap it with its correct positi... | 1.5 |
2,743 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort, we take minimum (or maximum) each time and put it in the right position in the list\nIn insertion sort, we check select an element, and then compare its value with every element of the list. This process is repeated for every element except the last | 2 |
2,744 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In selection sort we use a selected value and then compare with other values to sort where as in insertion sort there is no selected value.\nTime Complexity of Insertion Sort=O(n log n)\nTime Complexity of Selection Sort=O(n * n) | 2 |
2,745 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insert - o(n) , elements are inserted during traversal and list is sorted\nselection - o(n^2) , it is done by finding max or min element first and then all elements are sorted | 2 |
2,746 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | selection sort searches the unsorted part to find the minimum element while insertion | 0 |
2,747 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort we have to insert one space in steps during sorting but not in selection sort.\n | 1 |
2,748 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | in insertion sort we take an element and insert it in its right location by traversing through the data.\nIn selection sort the smallest element is selected and placed at it right place and the same process is repeated throughout. | 2.5 |
2,749 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | THE insertion sort inserts the values in a presorted file to sort a set of values. on the other hand, the selection sort finds the minimum number from the list and sorts it in the required order. | 2.5 |
2,750 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort and selection sorts are 2 types of sorting techniques | 1 |
2,751 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion sort and selection sorts are different because in insertion sort we first insert the element and while inserting the next element we check whether its smaller than the already inserted element or not while in selection sort we first select the minimum element then we keep on inserting like that. | 2.5 |
2,752 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort the array is also divided into two parts a sorted part and an unsorted part. In selection sort, the input array is divided into two parts a sorted part and an unsorted part. Selection sort scan the unsorted part to find the minimum element, while insertion sort scan the sorted part to find the corr... | 2.5 |
2,753 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | insertion sort compares element to determine the position of element in a partially sorted array whereas selection sort compares the element to find the minimum element in an unsorted array | 2.5 |
2,754 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Insertion Sort sorts the element while it is being inserted into an array. Selection sort goes through an array in a linear fashion, sorting two adjacent elements until they are in their sorted position. | 1 |
2,755 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort, there is shifting of elements to insert the element at its particular place whereas in selection sort, there is swapping of elements. | 1 |
2,757 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | In insertion sort, we assume we have 2 sub arrays : one containing the lone element is considered to be sorted and the other sub array is the unsorted one. We take an element from the unsorted array and place it in the sorted array in such a way that the previously sorted array remains sorted.\nIn selection sort, we se... | 2.5 |
2,758 | How insertion sort and selection sorts are different? | Both sorting techniques maintains two sub-lists, sorted and unsorted and both take one element at a time and places it into sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at appropriate location maintaining the properties of insertion sort. Whereas, selection sort... | Selection sort: Compares elements to find the minimum element in the unsorted part and places that element in the sorted part. \nInsertion sort: Compares elements to determine the position of an element in the partially sorted array. | 2.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.