FilesExpand file tree

 master

/

InsertionSort.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

24 lines (23 loc) · 646 Bytes

 master

/

InsertionSort.java

Top

File metadata and controls

• Code
• Blame

24 lines (23 loc) · 646 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

/**

* Name:Ahmed Elafifi

* Date: 30/10/2018

* category: Insertion Sort

*/

//no. of comparisons: n*(n-1)/4

//no. of copies: n*(n-1)/4

//for random data this algorithm runs twice as fast as the bubble sort and faster than the selection sort.

public void insertionSort()

{

int in, out;

for(out=1; out<nElems; out++) // out is dividing line

{

long temp = a[out]; // remove marked item

in = out; // start shifts at out

while(in>0 && a[in-1] >= temp) // until one is smaller,

{

a[in] = a[in-1]; // shift item right,

--in; // go left one position

}

a[in] = temp; // insert marked item

} // end for

} //