Question: Write a (list-based) insertion sort algorithm in Prolog. Heres what it looks like in C, using arrays: void insertion_sort(int A[], int N) int i, j,

Write a (list-based) insertion sort algorithm in Prolog. Here’s what it looks like in C, using arrays:

$void insertion_sort(int A[], int N) int i, j, t; for (i = 1; i < N; i++) { %3D t = A[i]; for (j = i; j > 0; j--) { if (t >= A[j-1]) break; A[j] A[j-1]; A[j] = t; }$

void insertion_sort(int A[], int N) int i, j, t; for (i = 1; i < N; i++) { %3D t = A[i]; for (j = i; j > 0; j--) { if (t >= A[j-1]) break; A[j] A[j-1]; A[j] = t; }

Step by Step Solution

★★★★★

3.52 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

Here is a listbased insertion sort algorithm in Prolog insertionsortList Sor... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Programming Language Pragmatics Questions!

A compare-exchange operation on two array elements A[i] and A[j], where i A[j] 2 exchange A[i] with A[j] After the compare-exchange operation,...

Quicksort works well for large lists, but has higher overhead than insertion sort for short lists. Write a sort algorithm in Prolog that uses quicksort initially, but switches to insertion sort (as...

The purpose of this assignment is to give you practice working with arrays, passing them to functions, sorting, searching and reading and writing text files. In this program you will read two files...

IN JAVA PLEASE Implement the insertion sort algorithm. Implement the merge sort algorithm. Test the sorting algorithm as follows. For input sizes n = 5,000, n = 10,000, n = 15,000, ..., n = 100,000...

Rewrite the heap sort function as a descending order sort. Do not simply sort items in ascending order and then reverse the order of the array elements. Write a program to test your function. DATA...

This lab revisits sorting algorithms. You will: Implement and analyze two sort algorithms: InsertionSort MergeSort Using programming conventions (or patterns) that allow the performance of your...

The formula: (last first + 1) represents the number of elements the partition method is to work with. For arrays that are fewer than 7 (MIN_SIZE) entries, quickSort calls insertionSort method right...

Homework 3: sorting You have been given the following code: HW3.java import java.util.*; public class HW3 { static Random rand = new Random(); static int numComparisons = 0; // Swaps the elements at...

Insertion Sort Algorithm Checkpoint 1.1: Insertion sort For your first checkpoint, you will implement Insertion Sort algorithm that sorts an array of strings into ascending lexicographic order....

Arrays, Strings, Structures, Sorting, Pointers, Functions and Files Sort an array of STUDENT structures using the insertion sort algorithm. Your task: (**** PLEASE CODE THE FOLLOWING IN C, Thank you...

Discuss the difference between the operating and the financial lease. You have relocated to a new city where you require vehicles for your conveyance as required by your job. Which of the two type...

You have calculated an odds ratio of 4.0 from a cross sectionalstudy on a given disease and exposure. The confidence interval forthis odds ratio is from 0.6 to 7.0. This means that we can becertain...

As a result of the decision by the Federal Reserve and OCC in 1 9 9 7 to allow bank holding companies to acquire investment banks, the years 1 9 9 7 through 2 0 0 0 saw a large increase in the number...

5. Determine how much to order

This exercise examines the accuracy of various branch predictors for the following repeating pattern (e.g., in a loop) of branch outcomes: T, NT, T, T, NT 1. What is the accuracy of always-taken and...

This exercise explores how exception handling affects pipeline design. The first three problems in this exercise refer to the following two instructions: Instruction 1...................Instruction 2...

In this exercise we compare the performance of 1-issue and 2-issue processors, taking into account program transformations that can be made to optimize for 2-issue execution. Problems in this...

help me please thank you very much Every morning your alarm clock goes off at exactly 8 am. There's a probability of % that you decide to hit the snooze button once (each morning is independent)....

Two options have been provided by the mechanical engineer to the manager to improve the productivity of the factory. These options are expected to reduce manual tasks by installing new automated...

10 - Which of the following statements is POSITIVE? a) was este b) It is bad that a free labor market leads to low wages for unskilled labor in Turkey There is more inequality in wages in 2020 than...