python - Comb Sorting Program -


i trying write program in python should sort list within list.

examples - 

list before sorting: [[2, 1], [2, 2], [3, 3], [3, 1], [1, 1], [1, 2]]  list after sorting: [[1, 1], [1, 2], [2, 1], [2, 2], [3, 1], [3, 3]]  list before sorting: [[3, 3], [2, 2], [1, 2], [2, 1], [3, 1], [1, 1]] list after sorting: [[1, 1], [2, 1], [1, 2], [2, 2], [3, 1], [3, 3]]  list before sorting: [[1, 1], [3, 3], [2, 1], [2, 2], [1, 2], [3, 1]] list after sorting: [[1, 1], [1, 2], [2, 1], [2, 2], [3, 1], [3, 3]]

my code:

import math  def combsort(list1):     gap = len(list1)     shrink = 1.3     sorted = false      while sorted == false:         gap = gap/shrink         if gap > 1:             sorted = false         else:             gap = 1             sorted = true          = 0         while + gap < gap:             distance1 = math.sqrt(list1[i[0]]**2 + list1[i[1]]**2)             distance2 = math.sqrt(list1[i+gap[0]]**2 + list1[i+gap[1]]**2)             if distance1 > distance2:                 temporary = list1[i]                 list1[i] = list1[i + gap]                 temporary = list1[i + gap]                 sorted = false             = + 1  list1 = [[2, 1], [2, 2], [3, 3], [3, 1], [1, 1], [1, 2]]  combsort(list1) print(list1)

my code doesn't work , prints out exact same list. help?

this given follow:

comb sort variation of bubble sort performs more efficient sorting. accomplishes moving low values near end of list further toward front of list bubble sort during iterations.

implement function called combsort following:

  1. takes input 2d list contains information representing x/y points in 2d space. each item in list list 2 items x , y coordinate. example, list [ [0, 1],[2, 1], [3, 3], [1, 1], … ]
  2. list item performs in-place sort (i.e., not create new list, modifies original) using comb sort algorithm sorts 2d list such points lower 2 euclidean distance origin (0, 0) appear earlier in list. in case, comparing distances instead of directly comparing list values – may useful implement , use distance calculation function. note – euclidean distance of point (x, y) origin (0, 0) can calculated following equation: distance(x,y) = �! + �!
  3. does not return value. input list sorted in place, modified directly , these modifications reflected outside function, return value not needed.

the while loop never gets executed because condition cannot true:

while + gap < gap:

hint: use more print statements or debugger check values of things while program running.


Comments

Post a Comment

Popular posts from this blog

c# - Update a combobox from a presenter (MVP) -

i using mvp in project, new in mvp. have 2 comboboxes. when select option in combobox, combobox should filled new data. this action in presenter. view 'view1' in presenter, , introduced combobox1 , combobox2 properties in 'view1', because need 'datasource', 'displaymember', 'valuemember' , 'refresh()' in method below. but, when using pattern, enough send property like public string combobox2 { { return combobox1.selectedvalue.tosstring(); } } into presenter not whole combobox. how can solve problem? public void onselectedindexchangedcombobox1() { if (view1.combobox1.selectedindex == -1) { return; } datatable dt = tools.getdatatable("a path"); var query = (from o in dt.asenumerable() o.field<string>("afield") == farmerview.combobox1.selectedvalue.tostring() orderby o.field<string>("anotherfield") select...
Read more

How to understand 2 main() functions after using uftrace to profile the C++ program? -

i trying uftrace profile following simple c++ program: #include <iostream> class { public: a() {std::cout << "a created" << std::endl;} ~a() {std::cout << "a destroyed" << std::endl;} }; int main() { a; return 0; } the profile result this: # uftrace a.out created destroyed # duration tid function 2.026 [ 4828] | __cxa_atexit(); [ 4828] | main() { [ 4828] | __static_initialization_and_destruction_0() { 89.397 [ 4828] | std::ios_base::init::init(); 0.768 [ 4828] | __cxa_atexit(); 93.029 [ 4828] | } /* __static_initialization_and_destruction_0 */ 94.425 [ 4828] | } /* main */ [ 4828] | main() { [ 4828] | a::a() { 11.104 [ 4828] | std::operator <<(); 10.825 [ 4828] | std::basic_ostream::operator <<(); 24.514 [ 4828] | } /* a::a */ [ 4828] | a::~a() { 0.978 [ 4828] | ...
Read more

How to put a lock and transaction on table using spring 4 or above using jdbcTemplate and annotations like @Transactional? -

i trying put lock on table while writing on table , if happened in between roll-back . trying convert below code lock table test_g1 read; lock table test_g write; -- begin; start transaction; insert test_g1 values(143); insert test_g values(145); select * test_g1; select * test_g; rollback; select * test_g; unlock tables; how convert above code @transactional spring jdbctemplate code? @transactional(rollbackfor={dataaccessexception.class}) public void test(){ jdbctemplate.execute("insert test1 (id, nam) values (4, 'a')"); throw new dataaccessexception("error") { }; } here trying throw error, insert statement should rollback it's not happening . thanks edit-1 attaching code , doing in jdbcdaoimpl.java , mentioned problem comment above test() . app.java package com.cgiri.javabrains.spring4; import org.springframework.beans.factory.annotation.autowired; import org.springframework.context.applic...
Read more